Browse State-of-the-Art › Graphon Estimation
Graphon Estimation
5 papers with code · 0 benchmarks · 1 dataset archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
1 dataset whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
5 shown of 5 papers with code (21 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
17 Sep 2022 1 repository listedThe proposed joint network and graphon estimation is further enhanced with the introduction of a robust method for noisy graph sampling information.
-
11 Feb 2022 1 repository listedWe consider the problem of estimating the topology of multiple networks from nodal observations, where these networks are assumed to be drawn from the same (unknown) random graph model.
-
2 Jun 2019 1 repository listedWe consider estimating the edge-probability matrix of a network generated from a graphon model when the full network is not observed---only some overlapping subgraphs are.
-
29 Sep 2015 1 repository listedThe estimation of probabilities of network edges from the observed adjacency matrix has important applications to predicting missing links and network denoising.
-
21 Jun 2014 1 repository listedWe put ours and previously proposed SDPs in a unified framework, as relaxations of the MLE over various sub-classes of the SBM, revealing a connection to sparse PCA.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections