Random walks on networks: cumulative distribution of cover time
Mathematical Physics
2009-10-20 v1 math.MP
Abstract
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a complete graph, a cycle graph, and a path graph. An accurate approximation for the cover time distribution, with computational complexity of O(2n), is also presented. The approximation is numerically tested only for graphs with n<=1000 nodes.
Keywords
Cite
@article{arxiv.0910.3545,
title = {Random walks on networks: cumulative distribution of cover time},
author = {Nikola Zlatanov and Ljupco Kocarev},
journal= {arXiv preprint arXiv:0910.3545},
year = {2009}
}