title: 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 α that depends on the degree-degree correlations and is equal to 1 in uncorrelated graphs.
authors.affiliation: Dipartimento di Fisica e Astronomia, Università di Catania and INFN, Via Santa Sofia, 64, I-95123 Catania, Italy.
authors.forename: Roberta
authors.initials: R
authors.lastname: Sinatra
authors.forename: Jesús
authors.initials: J
authors.lastname: Gómez-Gardeñes
authors.forename: Renaud
authors.initials: R
authors.lastname: Lambiotte
authors.forename: Vincenzo
authors.initials: V
authors.lastname: Nicosia
authors.forename: Vito
authors.initials: V
authors.lastname: Latora