On a cover time problem on a dynamic graph with steps at random times
Probability
2023-03-02 v2 Combinatorics
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. Time to cover all nodes and number of returns to original states are analyzed in resulting model.
Cite
@article{arxiv.2110.01083,
title = {On a cover time problem on a dynamic graph with steps at random times},
author = {Yunus Emre Demirci and Ümit Işlak and Mehmet Akif Yıldız},
journal= {arXiv preprint arXiv:2110.01083},
year = {2023}
}