Maximal entropy random walk in community finding

Abstract

The aim of this paper is to check feasibility of using the maximal-entropy random walk in algorithms finding communities in complex networks. A number of such algorithms exploit an ordinary or a biased random walk for this purpose. Their key part is a (dis)similarity matrix, according to which nodes are grouped. This study encompasses the use of the stochastic matrix of a random walk, its mean first-passage time matrix, and a matrix of weighted paths count. We briefly indicate the connection between those quantities and propose substituting the maximal-entropy random walk for the previously chosen models. This unique random walk maximises the entropy of ensembles of paths of given length and endpoints, which results in equiprobability of those paths. We compare performance of the selected algorithms on LFR benchmark graphs. The results show that the change in performance depends very strongly on the particular algorithm, and can lead to slight improvements as well as significant deterioration.

7 pages, 4 figures, submitted to European Physical Journal Special Topics following the 4-th Conference on Statistical Physics: Modern Trends and Applications, July 3-6, 2012 Lviv, Ukraine

References in corpus (7)

• Benchmark graphs for testing community detection algorithms
• Comparing community structure identification
• Communicability in complex networks
• Maximal-entropy random walks in complex networks with limited information
• Communicability Graph and Community Structures in Complex Networks
• Topologically biased random walk with application for community finding in networks
• Random elastic networks : strong disorder renormalization approach