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 {𝑢, 𝑣 } with distance 𝑑 > 1 is added as a “long-range" edge with probability proportional to 𝑑−𝑟, where 𝑟 ≥ 0 is a parameter of the model...

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak: Dyer, ME, Galanis, A, Goldberg, L, Jerrum, M, Vigoda, E
Formatua: Journal article
Hizkuntza:English
Argitaratua: Association for Computing Machinery 2020

Antzeko izenburuak