A Central Limit Theorem for the Mean Starting Hitting Time for a Random Walk on a Random Graph

Matthias Löwe () and Sara Terveer ()
Additional contact information
Matthias Löwe: Universität Münster
Sara Terveer: Universität Münster

Journal of Theoretical Probability, 2023, vol. 36, issue 2, 779-810

Abstract: Abstract We consider simple random walk on a realization of an Erdős–Rényi graph with n vertices and edge probability $$p_n$$ p n . We assume that $$n p^2_n/(\log \mathrm{n})^{16 \xi } \rightarrow \infty $$ n p n 2 / ( log n ) 16 ξ → ∞ for some $$\xi >1$$ ξ > 1 defined below. This in particular implies that the graph is asymptotically almost surely (a.a.s.) connected. We show a central limit theorem for the average starting hitting time, i.e., the expected time it takes the random walker on average to first hit a vertex j when starting in a fixed vertex i. The average is taken with respect to $$\pi _j$$ π j , the invariant measure of the random walk.

Keywords: Random walks on random graphs; Central limit theorem; Spectra of random graphs; U-statistics; 60F05; 60G50; 05C80 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10959-022-01195-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:36:y:2023:i:2:d:10.1007_s10959-022-01195-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959

DOI: 10.1007/s10959-022-01195-9

Access Statistics for this article

Journal of Theoretical Probability is currently edited by Andrea Monica

More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().