Maximal-entropy random walks in complex networks with limited information

Details Maximal-entropy random walks in complex networks with limited information Maximal-entropy random walks in complex networks with limited information

2010-07-28

arxiv.org/abs/1007.4936v2

Phys. Rev. E 83, 030103(R) (2011)

Physics

Condensed Matter

Statistical Mechanics

4 pages, 1 figure, 1 table + 1 page supplementary material

Scientific paper

10.1103/PhysRevE.83.030103

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.

Affiliated with

Also associated with

No associations

Rating

Maximal-entropy random walks in complex networks with limited information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximal-entropy random walks in complex networks with limited information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximal-entropy random walks in complex networks with limited information will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-73981