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

DOI10.1016/J.SPL.2023.109821zbMath1515.05158arXiv2110.01083OpenAlexW4322487903MaRDI QIDQ6165378

Mehmet Akif Yıldız, Ümit Işlak, Yunus Emre Demirci

Publication date: 4 July 2023

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.01083

zbMATH Keywords

random walkcover timedynamic graphcoupon collecting

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• On the time to traverse all edges of a graph
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Markov Chains
• Trading Space for Time in Undirected s-t Connectivity
• Crawling on Simple Models of Web Graphs
• Extremal cover times for random walks on trees
• Out-of-equilibrium random walks

This page was built for publication: On a cover time problem on a dynamic graph with steps at random times