Random walks between leaves of random networks

DOI10.1016/J.PHYSA.2013.10.034zbMATH Open1395.82097arXiv1207.6994OpenAlexW2964331968MaRDI QIDQ1782573FDOQ1782573

Authors: D. J. Lancaster 

Publication date: 20 September 2018

Published in: Physica A (Search for Journal in Brave)

Abstract: We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs and Barabasi-Albert scale free networks, these walks are not transient and we consider various approaches to computing the probability of a given length walk.One approach is to label nodes according to both their total degree and the number of links connected to leaf nodes, and as a byproduct we compute the probability of a random node of a scale free network having such a label.

Full work available at URL: https://arxiv.org/abs/1207.6994

Recommendations

• Random walks and diffusion on networks
• Random walks on graphs: ideas, techniques and results
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks
• The distribution of first hitting times of non-backtracking random walks on Erdos-Rényi networks
• Kinetic growth walks on complex networks

zbMATH Keywords

random walkrandom graphinternet traffic

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Random walks on graphs (05C81) Internet topics (68M11)

Cites Work

• Statistical mechanics of complex networks
• A guide to first-passage processes
• A critical point for random graphs with a given degree sequence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs
• First-passage properties of the Erdos–Renyi random graph
• Rate equation appraoch for growing networks
• Crawling on Simple Models of Web Graphs
• Title not available (Why is that?)

Cited In (2)

• Kinetic growth walks on complex networks
• Random walks and diffusion on networks

This page was built for publication: Random walks between leaves of random networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782573)