Find Your Place: Simple Distributed Algorithms for Community Detection
From MaRDI portal
Publication:5115703
DOI10.1137/19M1243026zbMath1451.68344arXiv1511.03927OpenAlexW3047272534MaRDI QIDQ5115703
Luca Trevisan, Francesco Pasquale, Luca Becchetti, Emanuele Natale, Andrea E. F. Clementi
Publication date: 18 August 2020
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.03927
Related Items
Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models ⋮ Distributed detection of clusters of arbitrary size
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Belief propagation, robust reconstruction and optimal recovery of block models
- A simple population protocol for fast robust approximate majority
- Reconstruction and estimation in the planted partition model
- An optimal bit complexity randomized distributed MIS algorithm
- Random graph coverings. I: General theory and graph connectivity
- Distributed average consensus with least-mean-square deviation
- A simplified neuron model as a principal component analyzer
- The Metropolis algorithm for graph bisection
- A proof of the block model threshold conjecture
- Distributed probabilistic polling and applications to proportionate agreement
- Survey of local algorithms
- Spectral redemption in clustering sparse networks
- Exact Recovery in the Stochastic Block Model
- The solution of some random NP-hard problems in polynomial expected time
- A Biological Solution to a Fundamental Distributed Computing Problem
- Authoritative sources in a hyperlinked environment
- Social influence and opinions
- Approximating the Permanent
- Gossip Algorithms
- Expander graphs and their applications
- Sufficient Conditions for Convergence of the Sum–Product Algorithm
- Graph Partitioning via Adaptive Spectral Techniques
- Locality in Distributed Graph Algorithms
- Community Detection and Stochastic Block Models
- Broadcast Gossip Algorithms for Consensus
- Recovery and Rigidity in a Regular Stochastic Block Model
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Reaching a Consensus
- Eigenvector Computation and Community Detection in Asynchronous Gossip Models
- Convergence Speed in Distributed Consensus and Averaging
- Community detection thresholds and the weak Ramanujan property
- Concentration and regularization of random graphs
- Timing in chemical reaction networks
- Lumpability and Commutativity of Markov Processes
- On the Analysis of a Label Propagation Algorithm for Community Detection
- The Rotation of Eigenvectors by a Perturbation. III
- Partitioning Well-Clustered Graphs: Spectral Clustering Works!
- The Accuracy of the Gaussian Approximation to the Sum of Independent Variates
- Step-By-Step Community Detection in Volume-Regular Graphs
- A decentralized algorithm for spectral analysis
- Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models
