Optimal graphon estimation in cut distance

DOI10.1007/s00440-018-0878-1zbMath1420.62143arXiv1703.05101OpenAlexW2963467977WikidataQ129031808 ScholiaQ129031808MaRDI QIDQ2312687

Nicolas Verzelen, Olga Klopp

Publication date: 17 July 2019

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.05101

zbMATH Keywords

graphonnetworksstochastic block modelinhomogeneous random graph\(W\)-random graphscut distance

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (5)

Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising ⋮ Transferability of graph neural networks: an extended graphon approach ⋮ Random geometric graph: some recent developments and perspectives ⋮ Network representation using graph root distributions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Rate-optimal graphon estimation
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Oracle inequalities for network models and sparse graphon estimation
• The method of moments and degree distributions for network models
• Community detection in sparse networks via Grothendieck's inequality
• Limits of dense graph sequences
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Quick approximation to matrices and applications
• Concentration inequalities using the entropy method
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• Random sampling and approximation of MAX-CSPs
• Rank penalized estimators for high-dimensional matrices
• Consistent nonparametric estimation for heavy-tailed sparse graphs
• Matrix estimation by universal singular value thresholding
• Stochastic blockmodels with a growing number of classes
• A nonparametric view of network models and Newman–Girvan and other modularities
• Graph limits and exchangeable random graphs
• On the best constants in the Khinchin inequality
• Latent Space Approaches to Social Network Analysis
• An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
• Graphons, cut norm and distance, couplings and rearrangements
• The phase transition in inhomogeneous random graphs
• Estimating network edge probabilities by neighbourhood smoothing

This page was built for publication: Optimal graphon estimation in cut distance