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


Demirci Y. E., IŞLAK Ü., Yıldız M. A.

Statistics and Probability Letters, cilt.197, 2023 (SCI-Expanded, Scopus)

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 197
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1016/j.spl.2023.109821
  • Dergi Adı: Statistics and Probability Letters
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, MathSciNet, zbMATH, DIALNET
  • Anahtar Kelimeler: Coupon collecting, Cover time, Dynamic graph, Random walk
  • Boğaziçi Üniversitesi Adresli: Evet

Özet

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.