Distributed Community Detection in Dynamic Graphs

Inspired by the increasing interest in self-organizing social opportunistic networks, we investigate the problem of distributed detection of unknown communities in dynamic random graphs. As a formal framework, we consider the dynamic version of the well-studied \emph{Planted Bisection Model} \(\sdG(...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2013-06
Hauptverfasser:	Clementi, Andrea, Miriam di Ianni, Gambosi, Giorgio, Natale, Emanuele, Silvestri, Riccardo
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Communities Computer Science - Distributed, Parallel, and Cluster Computing Computer Science - Social and Information Networks Graphs Markov chains Mathematics - Probability
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!