arXiv · 1007.4936
Maximal-entropy random walks in complex networks with limited information
Abstract
Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph structure. In particular, we show that an almost maximal-entropy random walk is obtained when the step probabilities are proportional to a power of the degree of the target node, with an exponent $\alpha$ that depends on the degree-degree correlations, and is equal to 1 in uncorrelated graphs.
Explore related subjects
Keep this discovery
Roberta Sinatra, Jesús Gómez-Gardeñes, Renaud Lambiotte, Vincenzo Nicosia, Vito Latora. 2010-07-28. Maximal-entropy random walks in complex networks with limited information. https://doi.org/10.1103/physreve.83.030103
Cite the original work for its findings. Save a collection to share your selection of sources.