Random walks and the regeneration time
โ
Beveridge, Andrew; Lov๏ฟฝsz, L๏ฟฝszl๏ฟฝ
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 218 KB
๐ 2 views
Consider a graph G and a random walk on it. We want to stop the random walk at certain times (using an optimal stopping rule) to obtain independent samples from a given distribution ฯ on the nodes. For an undirected graph, the expected time between consecutive samples is maximized by a distribution