First-passage properties of the Erdos–Renyi random graph

DOI10.1088/0305-4470/38/1/007zbMath1067.60001arXivcond-mat/0410309OpenAlexW2044840777MaRDI QIDQ4653631

Daniel Ben-Avraham, S. Redner, Vijay K. Sood

Publication date: 7 March 2005

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

Full work available at URL: https://arxiv.org/abs/cond-mat/0410309

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Related Items (26)

MFPT calculation for random walks in inhomogeneous networks ⋮ Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ Graph simplification and matching using commute times ⋮ Analytical results for the distribution of first-passage times of random walks on random regular graphs ⋮ Anomalous electrical and frictionless flow conductance in complex networks ⋮ Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks ⋮ Random walks and diffusion on networks ⋮ A central limit theorem for the mean starting hitting time for a random walk on a random graph ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ Efficiency of transportation on weighted extended Koch networks ⋮ Discrete diffusion-type equation on regular graphs and its applications ⋮ Efficiency of long-range navigation on treelike fractals ⋮ The distribution of first hitting times of randomwalks on Erdős–Rényi networks ⋮ On hitting times for a simple random walk on dense Erdös-Rényi random graphs ⋮ The distribution of first hitting times of random walks on directed Erdős–Rényi networks ⋮ On the Markov Transition Kernels for First Passage Percolation on the Ladder ⋮ From first-passage times of random walks in confinement to geometry-controlled kinetics ⋮ Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs ⋮ Hitting times, commute times, and cover times for random walks on random hypergraphs ⋮ Trapping on modular scale-free and small-world networks with multiple hubs ⋮ Random walks between leaves of random networks ⋮ Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks ⋮ Gaussian networks generated by random walks ⋮ Scaling of average weighted shortest path and average receiving time on weighted expanded Koch 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 return times of random walks on random regular graphs

This page was built for publication: First-passage properties of the Erdos–Renyi random graph