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

DOI10.1088/1742-5468/aa657ezbMath1457.82162arXiv1703.10269OpenAlexW2604771664MaRDI QIDQ3303029

O. Biham, Ido Tishby, Eytan Katzav

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

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 ⋮ Random walks and diffusion on networks ⋮ Multiseasonal discrete-time risk model revisited

Uses Software

• DLMF

Cites Work

• 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
• Universality for the distance in finite variance random graphs
• On the cover time of random walks on graphs
• Metric structure of random networks
• Distances in random graphs with finite mean and infinite variance degrees
• A Guide to First-Passage Processes
• The distribution of first hitting times of randomwalks on Erdős–Rényi networks
• Random Walks on Lattices. II
• Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs
• Statistical mechanics of complex networks
• The distribution of path lengths of self avoiding walks on Erdős–Rényi networks
• Random Walk: A Modern Introduction
• Universality for distances in power-law random graphs
• Tailored graph ensembles as proxies or null models for real networks I: tools for quantifying structure
• First-passage properties of the Erdos–Renyi random graph
• 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
• Networks

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