Skip to Main content Skip to Navigation
Conference papers

Graph Clustering Based on Mixing Time of Random Walks

Abstract : 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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01087693
Contributor : Mahmoud El Chamie <>
Submitted on : Wednesday, November 26, 2014 - 3:00:26 PM
Last modification on : Thursday, September 24, 2020 - 10:22:03 AM
Long-term archiving on: : Friday, February 27, 2015 - 12:26:07 PM

File

CamReadyICC2014.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

366

Files downloads

438