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...
Main Authors: | Dyer, ME, Galanis, A, Goldberg, L, Jerrum, M, Vigoda, E |
---|---|
格式: | Journal article |
语言: | English |
出版: |
Association for Computing Machinery
2020
|
相似书籍
Metastability of the Potts ferromagnet on random regular graphs
由: Coja-Oghlan, A, et al.
出版: (2022)
由: Coja-Oghlan, A, et al.
出版: (2022)
相似书籍
-
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
由: Goldberg, L, et al.
出版: (2015) -
Approximately counting H-colourings is BIS-Hard
由: Galanis, A, et al.
出版: (2015) -
A complexity trichotomy for approximately counting list H-colourings
由: Galanis, A, et al.
出版: (2017) -
A complexity trichotomy for approximately counting list H-colourings
由: Goldberg, L, et al.
出版: (2016) -
Approximately counting H-colourings is #BIS-hard
由: Galanis, A, et al.
出版: (2016)