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 a that depends on the degree-degree correlations and is equal to 1 in uncorrelated graphs. RI Gomez-Gardenes, Jesus/A-3226-2009; Lambiotte, Renaud/C-1085-2009; Sinatra, Roberta/G-9836-2012

Maximal-entropy random walks in complex networks with limited information

LATORA, Vito Claudio
2011

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 a that depends on the degree-degree correlations and is equal to 1 in uncorrelated graphs. RI Gomez-Gardenes, Jesus/A-3226-2009; Lambiotte, Renaud/C-1085-2009; Sinatra, Roberta/G-9836-2012
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/20.500.11769/13662
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 76
  • ???jsp.display-item.citation.isi??? 74
social impact