Random walk in the complete graph : hitting and cover times
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
