Distributed community detection in dynamic graphs

DOI10.1016/j.tcs.2014.11.026zbMath1315.68266OpenAlexW2176844533MaRDI QIDQ2345454

Emanuele Natale, Miriam Di Ianni, Andrea E. F. Clementi, Riccardo Silvestri, Giorgio Gambosi

Publication date: 22 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.743.7395

zbMATH Keywords

distributed computingdynamic graphssocial opportunistic networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (5)

Community detection with the label propagation algorithm: a survey ⋮ Simple dynamics for plurality consensus ⋮ Evolution properties of the community members for dynamic networks ⋮ The Maximum Label Propagation Algorithm on Sparse Random Graphs ⋮ Distributed Community Detection in Dynamic Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The structure and function of networks
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• The Metropolis algorithm for graph bisection
• Complex networks: structure and dynamics
• Flooding time in edge-Markovian dynamic graphs
• The solution of some random NP-hard problems in polynomial expected time
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Community structure in social and biological networks
• Parsimonious flooding in dynamic graphs
• On the Analysis of a Label Propagation Algorithm for Community Detection

This page was built for publication: Distributed community detection in dynamic graphs