The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks

DOI10.1088/1751-8121/aa68c2zbMath1369.82018arXiv1609.08375OpenAlexW2526563309MaRDI QIDQ5272490

Ido Tishby, O. Biham, Eytan Katzav

Publication date: 29 June 2017

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

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

zbMATH Keywords

random walkdegree distributionself-avoiding walkfirst hitting timerandom networkErdös-Rényi network

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Random walks on graphs (05C81)

Related Items (4)

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 ⋮ A new method for quantifying network cyclic structure to improve community detection ⋮ Analytical results for the distribution of first hitting times of random walks on random regular graphs

Uses Software

• DLMF

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
• Diffusion and Reactions in Fractals and Disordered Systems
• Machine Learning in Complex Networks
• Elements of Random Walk and Diffusion Processes
• The distribution of first hitting times of randomwalks on Erdős–Rényi networks
• Random Walks on Lattices. II
• The distribution of path lengths of self avoiding walks on Erdős–Rényi networks
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• 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

This page was built for publication: The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks