Random walks on small world networks

From MaRDI portal
Publication:4987458




Abstract: 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 dr, where rgeq0 is a parameter of the model. Kleinberg studied a close variant of this network model and proved that the (decentralised) routing time is O((logn)2) when r=2 and nOmega(1) when req2. Here, we prove that the random walk also undergoes a phase transition at r=2, but in this case the phase transition is of a different form. We establish that the mixing time is Theta(logn) for r<2, O((logn)4) for r=2 and nOmega(1) for r>2.









This page was built for publication: Random walks on small world networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987458)