Random walk in the complete graph : hitting and cover times - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2023

Random walk in the complete graph : hitting and cover times

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.
Fichier principal
Vignette du fichier
complete.pdf (302.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04365696 , version 1 (28-12-2023)

Licence

Attribution

Identifiers

  • HAL Id : hal-04365696 , version 1

Cite

François Castella, Bruno Sericola. Random walk in the complete graph : hitting and cover times. Centre Inria. 2023. ⟨hal-04365696⟩
68 View
13 Download

Share

Gmail Facebook X LinkedIn More