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 with distance is added as a "long-range" edge with probability proportional to , where is a parameter of the model. Kleinberg studied a close variant of this network model and proved that the (decentralised) routing time is when and when . Here, we prove that the random walk also undergoes a phase transition at , but in this case the phase transition is of a different form. We establish that the mixing time is for , for and for .
Recommendations
Cited in
(11)- Neighbor selection and hitting probability in small-world graphs
- Speeding up random walk mixing by starting from a uniform vertex
- The mixing time of the Newman-Watts small world
- Random spreading phenomena in annealed small world networks
- The small world effect on the coalescing time of random walks
- Scale-free percolation mixing time
- A Matrix Perturbation View of the Small World Phenomenon
- Scaling properties of a random walk on small-world networks with an open boundary
- Spatio-spectral limiting on discrete tori: adjacency invariant spaces
- On the modified Newman-Watts small world and its random walk
- scientific article; zbMATH DE number 1950482 (Why is no real title available?)
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)