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.

Nicolás Rivera coauthored, with Richard Pymar, an analysis of the density process of the noisy voter model. The process averages binary opinions using the stationary distribution of an underlying Markov chain. Their results identify different limiting behaviors as graph size and noise vary, linking the graph geometry and copying dynamics to the form of macroscopic fluctuations.^[ref]