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

@article{Lowe2022ACL,
  title={A Central Limit Theorem for the Mean Starting Hitting Time for a Random Walk on a Random Graph},
  author={Matthias Lowe and Sara Terveer},
  journal={Journal of Theoretical Probability},
  year={2022}
}
<jats:p>We consider simple random walk on a realization of an Erdős–Rényi graph with <jats:italic>n</jats:italic> vertices and edge probability <jats:inline-formula><jats:alternatives><jats:tex-math>$$p_n$$</jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>p</mml:mi> <mml:mi>n</mml:mi> </mml:msub> </mml:math></jats:alternatives></jats:inline-formula>. We assume that <jats… 

A Central Limit Theorem for the average target hitting time for a random walk on a random graph

. Consider a simple random walk on a realization of an Erd˝os-R´enyi graph. Assume that it is asymptotically almost surely (a.a.s.) connected. Conditional on an eigenvector delocalization conjecture,

A Central Limit Theorem for incomplete U-statistics over triangular arrays

We analyze the fluctuations of incomplete $U$-statistics over a triangular array of independent random variables. We give criteria for a Central Limit Theorem (CLT, for short) to hold in the sense

References

SHOWING 1-10 OF 31 REFERENCES

Random walks on the random graph

It is proved that starting from a uniform vertex both accelerates mixing to $O(\log n)$ and concentrates it (the cutoff phenomenon occurs), and analogous results are given for graphs with prescribed degree sequences, where cutoff is shown both for the simple and for the non-backtracking random walk.

Random Walks on Infinite Graphs and Groups

Part I. The Type Problem: 1. Basic facts 2. Recurrence and transience of infinite networks 3. Applications to random walks 4. Isoperimetric inequalities 5. Transient subtrees, and the classification

First-passage properties of the Erdos Renyi random graph

An effective medium approximation is developed that predicts that the mean first-passage time between pairs of nodes, as well as all moments of this first- passage time, are insensitive to the fraction p of occupied links.

A Central Limit Theorem for incomplete U-statistics over triangular arrays

We analyze the fluctuations of incomplete $U$-statistics over a triangular array of independent random variables. We give criteria for a Central Limit Theorem (CLT, for short) to hold in the sense

Random walks and electric networks

The goal will be to interpret Polya’s beautiful theorem that a random walker on an infinite street network in d-dimensional space is bound to return to the starting point when d = 2, but has a positive probability of escaping to infinity without returning to the Starting Point when d ≥ 3, and to prove the theorem using techniques from classical electrical theory.

Hitting times, commute times, and cover times for random walks on random hypergraphs

Probability on graphs

The random assignment problem is to minimize the cost of an assignment in a n×n matrix of random costs. In this paper we study this problem for some integer valued cost distributions. We consider

Random Walks on Graphs: A Survey

Estimates on the important parameters of access time, commute time, cover time and mixing time are discussed and recent algorithmic applications of random walks are sketched, in particular to the problem of sampling.

Markov Chains and Mixing Times

This book is an introduction to the modern approach to the theory of Markov chains. The main goal of this approach is to determine the rate of convergence of a Markov chain to the stationary