30 citations · 183 across the 20 of their papers we have counts for
4 papers · 1 filter
Maximal entropy random walk in community finding
Jeremi K. Ochab, Zdzisław Burda
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…
Maximal-entropy random walk unifies centrality measures
J. K. Ochab
In this paper analogies between different (dis)similarity matrices are derived. These matrices, which are connected to path enumeration and random walks, are used in community dete…
Maximal Entropy Random Walk: solvable cases of dynamics
Jeremi K. Ochab
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graph…
Exact Solution for Statics and Dynamics of Maximal Entropy Random Walk on Cayley Trees
J. K. Ochab, Z. Burda
We provide analytical solutions for two types of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on a Cayley tree with arbitrary branching number, roo…