Average whenever you meet: opportunistic protocols for community detection

DOI10.4230/LIPICS.ESA.2018.7MaRDI QIDQ5009564zbMATH OpenFDO

Authors Luca Becchetti, Pasin Manurangsi, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan, Andrea Clementi, Emanuele Natale

Publication date 4 August 2021

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

zbMATH Keywords

community detectionrandom processesspectral analysis

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Distributed community detection in dynamic graphs
• Distributed Community Detection in Dynamic Graphs
• Find Your Place: Simple Distributed Algorithms for Community Detection
• Find your place: simple distributed algorithms for community detection
• Eigenvector Computation and Community Detection in Asynchronous Gossip Models

Cites work

• A proof of the block model threshold conjecture
• Community detection thresholds and the weak Ramanujan property
• Find your place: simple distributed algorithms for community detection
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• Recovery and rigidity in a regular stochastic block model

Cited in

(7)

• Distributed detection of clusters of arbitrary size
• Step-by-step community detection in volume-regular graphs
• Distributed community detection in dynamic graphs
• Find your place: simple distributed algorithms for community detection
• Find Your Place: Simple Distributed Algorithms for Community Detection
• Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models
• Community structure recovery and interaction probability estimation for gossip opinion dynamics

This page was built for publication: Average whenever you meet: opportunistic protocols for community detection

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