Stationary distribution and cover time of random walks on random digraphs
نویسندگان
چکیده
منابع مشابه
Stationary distribution and cover time of random walks on random digraphs
We study properties of a simple random walk on the random digraph Dn,p when np = d log n, d > 1. We prove that whp the value πv of the stationary distribution at vertex v is asymptotic to deg(v)/m where deg(v) is the in-degree of v and m = n(n − 1)p is the expected number of edges of Dn,p. If d = d(n) → ∞ with n, the stationary distribution is asymptotically uniform whp. Using this result we pr...
متن کاملRandom walks on networks: cumulative distribution of cover time.
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a complete graph, a cycle graph, and a path graph. An accurate approximation for the cover time distribution, with computational complexity of O(2n) , is also present...
متن کاملThe Cover Time of Random Digraphs
We study the cover time of a random walk on the random digraph Dn,p when p = d logn n , d > 1. We prove that whp the cover time is asymptotic to d log ( d d−1 ) n log n.
متن کاملThe Cover Time of Deterministic Random Walks
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this “deterministic random walk” covers all vertices (or all edges). We present general techniques to derive upper bounds for the vertex and edge cover time and derive matching lower bounds for several impo...
متن کاملRandom Walks on Ramanujan Complexes and Digraphs
The cutoff phenomenon was recently confirmed for random walks on Ramanujan graphs by the first author and Peres. In this work, we obtain analogs in higher dimensions, for random walk operators on any Ramanujan complex associated with a simple group G over a local field F . We show that if T is any k-regular G-equivariant operator on the Bruhat–Tits building with a simple combinatorial property ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2012
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.11.001