Abstract
We study properties of a simple random walk on the random digraph Dn,p when np=dlogn, 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 prove that, for d>1, whp the cover time of Dn,p is asymptotic to dlog(d/(d−1))nlogn. If d=d(n)→∞ with n, then the cover time is asymptotic to nlogn.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.