Browse State-of-the-Art › Graphon Estimation

Graphon Estimation

5 papers with code · 0 benchmarks · 1 dataset archive 2025-07-28

Graphs

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.

Papers archive 2025-07-28

archive papers tagged: 21 · with a code link: 5 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 21 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 21 of 21, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • 17 Sep 2022 1 repository listed
    The 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 listed
    We 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 listed
    We 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 listed
    The 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 listed
    We 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.
  • Estimating Dyadic Treatment Effects with Unknown Confounders
    26 May 2024 0 repositories listed
    This paper proposes a statistical inference method for assessing treatment effects with dyadic data.
  • Graph data augmentation with Gromow-Wasserstein Barycenters
    12 Apr 2024 0 repositories listed
    Graphs are ubiquitous in various fields, and deep learning methods have been successful applied in graph classification tasks.
  • Private graphon estimation via sum-of-squares
    18 Mar 2024 0 repositories listed
    We develop the first pure node-differentially-private algorithms for learning stochastic block models and for graphon estimation with polynomial running time for any constant number of blocks.
  • Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials
    30 Aug 2023 0 repositories listed
    Graphon estimation has been one of the most fundamental problems in network analysis and has received considerable attention in the past decade.
  • Graphon Estimation in bipartite graphs with observable edge labels and unobservable node labels
    7 Apr 2023 0 repositories listed
    Many real-world data sets can be presented in the form of a matrix whose entries correspond to the interaction between two entities of different natures (number of times a web user visits a web page, a student's grade…
  • Training Graph Neural Networks by Graphon Estimation
    4 Sep 2021 0 repositories listed
    In this work, we propose to train a graph neural network via resampling from a graphon estimate obtained from the underlying network data.
  • Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing
    14 Nov 2018 0 repositories listed
    This paper surveys some recent developments in fundamental limits and optimal algorithms for network analysis.
  • Consistent polynomial-time unseeded graph matching for Lipschitz graphons
    29 Jul 2018 0 repositories listed
    We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures.
  • Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations
    25 Jun 2018 0 repositories listed
    Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns.
  • Distributed Cartesian Power Graph Segmentation for Graphon Estimation
    25 May 2018 0 repositories listed
    We study an extention of total variation denoising over images to over Cartesian power graphs and its applications to estimating non-parametric network models.
  • Link prediction for egocentrically sampled networks
    12 Mar 2018 0 repositories listed
    Link prediction in networks is typically accomplished by estimating or ranking the probabilities of edges for all pairs of nodes.
  • Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation
    1 Dec 2017 0 repositories listed
    The sparse matrix estimation problem consists of estimating the distribution of an n×n matrix Y, from a sparsely observed single instance of this matrix where the entries of Y are independent random variables.
  • Rates of Convergence of Spectral Methods for Graphon Estimation
    10 Sep 2017 0 repositories listed
    This paper studies the problem of estimating the grahpon model - the underlying generating mechanism of a network.
  • Reducing Crowdsourcing to Graphon Estimation, Statistically
    23 Mar 2017 0 repositories listed
    Inferring the correct answers to binary tasks based on multiple noisy answers in an unsupervised manner has emerged as the canonical question for micro-task crowdsourcing or more generally aggregating opinions.
  • When is Nontrivial Estimation Possible for Graphons and Stochastic Block Models?
    7 Apr 2016 0 repositories listed
    Block graphons (also called stochastic block models) are an important and widely-studied class of models for random networks.
  • An iterative step-function estimator for graphons
    5 Dec 2014 0 repositories listed
    Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons.

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