Community detection and percolation of information in a geometric setting

DOI10.1017/S0963548322000098OpenAlexW3037879963MaRDI QIDQ5886352

Ronen Eldan, Dan Mikulincer, Hester Pieters

Publication date: 31 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

community detectionrandom geometric graphs

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Nonparametric estimation (62G05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (2)

Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems ⋮ Phase transition in noisy high-dimensional random geometric graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the time for Brownian motion to visit every point on a circle
• Universally consistent vertex classification for latent positions graphs
• User-friendly tail bounds for sums of random matrices
• Information flow on trees
• Reconstruction on trees: Beating the second eigenvalue
• Adaptive estimation of nonparametric geometric graphs
• Testing for high-dimensional geometry in random graphs
• Community Detection and Stochastic Block Models
• CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
• A useful variant of the Davis–Kahan theorem for statisticians
• Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
• Concentration and regularization of random graphs

This page was built for publication: Community detection and percolation of information in a geometric setting