Asymptotic behaviour of the noisy voter model density process by Richard Pymar and Nicolás Rivera 2026-11-05
View more
arXiv:2112.01478v2, 1 October 2024. Sections 1.1–1.2 define uniform single-vertex updates, fair rerandomization and the copying kernel. The weighted-Hamming contraction calculation in the wiki is derived explicitly for a finite undirected graph; its time unit is one vertex update, rather than one update per vertex.
Read the full article