On a cover time problem on a dynamic graph with steps at random times

On a cover time problem on a dynamic graph with steps at random times

We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Number of nodes covered at a certain time and number of returns to original states are analyzed in the resulting model.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Statistics & probability letters 2023-06, Vol.197, p.109821, Article 109821
Hauptverfasser: Demirci, Yunus Emre, Işlak, Ümi̇t, Yıldız, Mehmet Akif
Format: Artikel
Sprache:eng
Schlagworte:
Coupon collecting
Cover time
Dynamic graph
Random walk
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Number of nodes covered at a certain time and number of returns to original states are analyzed in the resulting model.
ISSN:0167-7152
1879-2103
DOI:10.1016/j.spl.2023.109821