Dynamically accelerated cover times
Among observables characterizing the random exploration of a graph or lattice, the cover time, namely, the time to visit every site, continues to attract widespread interest. Much insight about cover times is gained by mapping to the (spaceless) coupon collector problem, which amounts to ignoring sp...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
American Physical Society
2020-06-01
|
Series: | Physical Review Research |
Online Access: | http://doi.org/10.1103/PhysRevResearch.2.023421 |