Network navigation with non-Lèvy superdiffusive random walks

Emilio Aced Fuentes and Simone Santini

Physica A: Statistical Mechanics and its Applications, 2021, vol. 580, issue C

Abstract: We introduce a formalism based on a continuous time approximation to study the characteristics of random walks with jumps to random locations of the networks (Pagerank random walks). We find that the diffusion of the occupancy probability has a dynamics that exponentially “forgets” the initial conditions and settles to a steady state that depends only on the characteristics of the network. In the special case in which the walk begins from a single node, we show that the largest eigenvalue of the transition value (λ1=1) does not contribute to the dynamic and that the probability is constant in the direction of the corresponding eigenvector. We study the process of visiting new nodes, which we find to have a dynamic similar to that of the occupancy probability. Finally, we determine the average transit time between nodes 〈T〉.

Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437121004313
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:580:y:2021:i:c:s0378437121004313

DOI: 10.1016/j.physa.2021.126158

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().