Random Walks on Small World Networks
Random Walks on Small World Networks
We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices {u,v} with distance d> 1 is added as a ālong-rangeā edge with probability proportional to d -r , where rā„ 0 is a parameter of the ā¦