Community detection on Euclidean random graphs

MaRDI QIDQ4608036zbMATH OpenFDO

Authors Abishek Sankararaman, Francois Baccelli

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175447

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Community detection on Euclidean random graphs
• The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
• Finding one community in a sparse graph
• Community detection in the sparse hypergraph stochastic block model
• Community detection in sparse random networks

Cited in

(9)

• On the computational tractability of statistical estimation on amenable graphs
• Higher-order spectral clustering for geometric graphs
• Concentration and stability of community-detecting functions on random networks
• Weighted message passing and minimum energy flow for heterogeneous stochastic block models with side information
• Community detection on Euclidean random graphs
• Graph powering and spectral robustness
• CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
• scientific article; zbMATH DE number 7650120 (Why is no real title available?)
• A probabilistic view of latent space graphs and phase transitions

This page was built for publication: Community detection on Euclidean random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608036)