Random Walk in the Complete Graph: Hitting and Cover Times

François Castella () and Bruno Sericola ()
Additional contact information
François Castella: University of Rennes
Bruno Sericola: Inria

Methodology and Computing in Applied Probability, 2025, vol. 27, issue 2, 1-23

Abstract: Abstract We consider the moments and the distribution of the hitting and cover times of a random walk in the complete graph. We study both the time needed to reach any subset of states and the time needed to visit all the states of a subset at least once. We obtain recurrence relations for the moments of all orders and we use these relations to analyze the asymptotic behavior of the hitting and cover times distributions when the number of states tends to infinity.

Keywords: Markov chain; Random walk; Hitting times; Cover times; Complete graph; Moments; Asymptotic distribution; 05C81; 60J10 (search for similar items in EconPapers)
Date: 2025
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11009-025-10166-6 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:metcap:v:27:y:2025:i:2:d:10.1007_s11009-025-10166-6

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

DOI: 10.1007/s11009-025-10166-6

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().