The distribution of first hitting times of randomwalks on Erdős–Rényi networks

DOI10.1088/1751-8121/aa5af3zbMath1362.60044arXiv1606.01560OpenAlexW3105168990MaRDI QIDQ2979696

Ido Tishby, O. Biham, Eytan Katzav

Publication date: 26 April 2017

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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

zbMATH Keywords

random walkdegree distributionself-avoiding walkfirst hitting timerandom networksErdős-Rényi networksfirst intersection length

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Random walks on graphs (05C81)

Related Items (7)

Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ The interpolation between random walk and self-avoiding walk by avoiding marked sites ⋮ Analytical results for the distribution of first-passage times of random walks on random regular graphs ⋮ The distribution of first hitting times of random walks on directed Erdős–Rényi networks ⋮ The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks ⋮ Analytical results for the distribution of first hitting times of random walks on random regular graphs ⋮ Analytical results for the distribution of first return times of random walks on random regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the longest path in a graph
• Failure rate modeling for reliability and risk
• On the cover time of random walks on graphs
• New lower bounds on the self-avoiding-walk connective constant
• Diffusion and Reactions in Fractals and Disordered Systems
• Calculation of the connective constant for self-avoiding walks via the pivot algorithm
• Elements of Random Walk and Diffusion Processes
• Random Walks on Lattices. II
• The distribution of path lengths of self avoiding walks on Erdős–Rényi networks
• Random Walk: A Modern Introduction
• A model of self‐avoiding random walks for searching complex networks
• First-passage properties of the Erdos–Renyi random graph
• Kinetic growth walks on complex networks
• The average number of distinct sites visited by a random walker on random graphs
• Self-avoiding walk enumeration via the lace expansion
• A Guide to First-Passage Processes
• On the Number of Self-Avoiding Walks. II
• On the Number of Self-Avoiding Walks
• Networks

This page was built for publication: The distribution of first hitting times of randomwalks on Erdős–Rényi networks