CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION

DOI10.1142/9789813272880_0166zbMath1448.05179arXiv1801.08724OpenAlexW2973222627MaRDI QIDQ5122141

Elizaveta Levina, Can M. Le, R. V. Vershinin

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

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

zbMATH Keywords

network algorithmsstatistical network analysis

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Related Items (6)

Community detection and percolation of information in a geometric setting ⋮ Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model ⋮ Random geometric graph: some recent developments and perspectives ⋮ Spectral norm bounds for block Markov chain random matrices ⋮ Unnamed Item ⋮ Thin-shell theory for rotationally invariant random simplices

This page was built for publication: CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION