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

Yunus Emre Demirci, Ümi̇t Işlak and Mehmet Akif Yıldız

Statistics & Probability Letters, 2023, vol. 197, issue C

Abstract: 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.

Keywords: Dynamic graph; Random walk; Cover time; Coupon collecting (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167715223000457
Full text for ScienceDirect subscribers only

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:eee:stapro:v:197:y:2023:i:c:s0167715223000457

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spl.2023.109821

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().