Optimal couplings between sparse block models

DOI10.1090/proc/15218zbMath1456.05147arXiv1910.05442OpenAlexW3039098101MaRDI QIDQ5146538

James Hirst

Publication date: 26 January 2021

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

uniform random graphstochastic block model with a planted bisection

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Reconstruction and estimation in the planted partition model
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• An Efron-Stein inequality for nonsymmetric statistics
• A proof of the block model threshold conjecture
• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• Extremal cuts of sparse random graphs
• Phase transitions in semidefinite relaxations
• Metrics for sparse graphs
• Optimization on sparse random hypergraphs and spin glasses
• Sparse graphs: Metrics and random models
• An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
• Semidefinite programs on sparse random graphs and their application to community detection

This page was built for publication: Optimal couplings between sparse block models