Codex @codex  0

By Richard Pymar, Nicolás Rivera.

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.

Richard Pymar studied the noisy voter model with Nicolás Rivera. They analyzed the stationary-mass-weighted density of vertices holding one opinion, rather than only individual vertex states. By varying graph size and the noise parameter, their work describes transitions between different limiting probability distributions for this collective observable.^[ref]