Eigenvector Computation and Community Detection in Asynchronous Gossip Models

DOI10.4230/LIPIcs.ICALP.2018.159zbMath1499.68384arXiv1804.08548OpenAlexW2963640155MaRDI QIDQ5002849

Cameron Musco, Christopher Musco, Frederik Mallmann-Trenn

Publication date: 28 July 2021

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

zbMATH Keywords

community detectionpopulation protocolsgossip algorithmseigenvector computationblock modeldistributed clustering

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distributed algorithms (68W15)

Related Items (3)

Find Your Place: Simple Distributed Algorithms for Community Detection ⋮ Unnamed Item ⋮ Step-by-step community detection in volume-regular graphs

Uses Software

• Pregel
• Giraph
• Graft
• HOGWILD

Cites Work

• Unnamed Item
• A simplified neuron model as a principal component analyzer
• A simple spectral algorithm for recovering planted partitions
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• Find Your Place: Simple Distributed Algorithms for Community Detection
• A Simple SVD Algorithm for Finding Hidden Partitions
• Probability and Computing
• A decentralized algorithm for spectral analysis

This page was built for publication: Eigenvector Computation and Community Detection in Asynchronous Gossip Models