Random walks between leaves of random networks

David Lancaster

Physica A: Statistical Mechanics and its Applications, 2014, vol. 395, issue C, 511-522

Abstract: Motivated by the desire to model internet traffic we consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. We present and test two techniques to analyse these walks. On Erdős–Rényi random graphs where the probability of a walk decays exponentially with its length, the methods give indistinguishable results for the decay exponent. This simple form of decay is not apparent on heterogeneous networks such as Barabási–Albert scale free networks and in this case each technique is demonstrated to have a different strength.

Keywords: Random walk; Random graph; Internet traffic (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437113010066
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:395:y:2014:i:c:p:511-522

DOI: 10.1016/j.physa.2013.10.034

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 ().