REVIEW 1 cited by
On the stationary measures of two variants of the voter model
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In the voter model, vertices of a graph (interpreted as voters) adopt one out of two opinions (0 and 1), and update their opinions at random times by copying the opinion of a neighbor chosen uniformly at random. This process is dual to a system of coalescing random walks. The duality implies that the set of stationary measures of the voter model on a graph is linked to the dynamics of the collision of random walks on this graph. By exploring the key ideas behind this relationship, we characterize the sets of stationary measures for two variations of the voter model: first, a version that incorporates interchanging of opinions among voters, and second, the voter model on dynamical percolation. To achieve these results, we analyze the collision properties of random walks in two contexts: first, with a swapping behavior that complicates collisions, and second, with random walks defined on a dynamical percolation environment.
Forward citations
Cited by 1 Pith paper
-
Infinite collisions of simple random walks on random recursive trees generated by Bernoulli sequences
Random recursive trees generated by Bernoulli attachment almost surely have exactly one topological end and the infinite collision property for two independent simple random walks.
Discussion (0). Continue with ORCID to comment.