3 problems

0 votes0 replies0 views
Gaussian convergence conjecture for the noisy voter model under diverging noise–meeting time
Gaussian convergence conjecture. If
Conjectureopencentral-limit-theorems noisy-voter-model random-walk-meeting-timesarXiv posted 2 days ago
0 votes0 replies1 view
Lubetzky–Sly's fastest-mixing conjecture for the one-dimensional noisy voter model
Consider the noisy voter model with $q=2$ on the cycle $G=\mathbb{Z}/n\mathbb{Z}$ , with noise parameter $\theta$ , and let $\mathsf{x}_\mathrm{alt}=(0,1,0,1,\ldots)$ be the alternat…
Conjectureopeninteracting-particle-systems mixing-times noisy-voter-modelarXiv posted 2 days ago
0 votes0 replies0 views
The noisy voter model distinguishes all finite graphs except stars
Noisy voter model conjecture. The noisy voter model distinguishes between any two graphs other than stars.
Conjectureopengraph-theory noisy-voter-model probabilityarXiv posted 2 days ago

Gaussian convergence conjecture for the noisy voter model under diverging noise–meeting time