Graph Clustering Based on Mixing Time of Random Walks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Graph Clustering Based on Mixing Time of Random Walks


Clustering of a graph is the task of grouping its nodes in such a way that the nodes within the same cluster are well connected, but they are less connected to nodes in different clusters. In this paper we propose a clustering metric based on the random walks' properties to evaluate the quality of a graph clustering. We also propose a randomized algorithm that identifies a locally optimal clustering of the graph according to the metric defined. The algorithm is intrinsically distributed and asynchronous. If the graph represents an actual network where nodes have computing capabilities, each node can determine its own cluster relying only on local communications. We show that the size of clusters can be adapted to the available processing capabilities to reduce the algorithm's complexity.
Fichier principal
Vignette du fichier
CamReadyICC2014.pdf (1.1 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01087693 , version 1 (26-11-2014)



Konstantin Avrachenkov, Mahmoud El Chamie, Giovanni Neglia. Graph Clustering Based on Mixing Time of Random Walks. IEEE International Conference on Communications (ICC 2014), Jun 2014, Sydney, Australia. pp.4089-4094, ⟨10.1109/ICC.2014.6883961⟩. ⟨hal-01087693⟩
131 View
182 Download



Gmail Facebook Twitter LinkedIn More