Random walks on networks: cumulative distribution of cover time
Zlatanov, Nikola · Kocarev, Ljupco
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.