Analytical results for the distribution of first hitting times of random walks on random regular graphs

DOI10.1088/1751-8121/abe77dOpenAlexW3133117896MaRDI QIDQ5877020

Ido Tishby, O. Biham, Eytan Katzav

Publication date: 3 February 2023

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

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

zbMATH Keywords

random walkbacktrackingfirst hitting timerandom regular graphrandom networkretracingfirst intersection length

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

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 ⋮ Analytical results for the distribution of first-passage times of random walks on random regular graphs ⋮ Analytical results for the distribution of first return 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
• Failure rate modeling for reliability and risk
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• On the cover time of random walks on graphs
• Diffusion and Reactions in Fractals and Disordered Systems
• Role of depletion on the dynamics of a diffusing forager
• 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
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Random Walk: A Modern Introduction
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Networks
• Dynamical Processes on Complex Networks
• A model of self‐avoiding random walks for searching complex networks
• Kinetic growth walks on complex networks
• A critical point for random graphs with a given degree sequence
• The average number of distinct sites visited by a random walker on random graphs
• The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks
• The statistical mechanics of polymers with excluded volume
• A Guide to First-Passage Processes

This page was built for publication: Analytical results for the distribution of first hitting times of random walks on random regular graphs