REVIEW 2 cited by
The voter model on random regular graphs with random rewiring
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
abstract
We consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently reconnected at random. A parameter $\nu \in (0,\infty)$ regulates the frequency at which the rewirings take place, in such a way that any given edge is rewired exponentially at a rate $\nu$ in the limit as $n\to\infty$. We show that, under the joint law of the random rewiring dynamics and the random opinion dynamics, the fraction of vertices with either one of the two opinions converges on time scale $n$ to the Fisher-Wright diffusion with an explicit diffusion constant $\vartheta_{d,\nu}$ in the limit as $n\to\infty$. In particular, we identify $\vartheta_{d,\nu}$ in terms of a continued-fraction expansion and analyse its dependence on $d$ and $\nu$. A key role in our analysis is played by the set of discordant edges, which constitutes the boundary between the sets of vertices carrying the two opinions.
Forward citations
Cited by 2 Pith papers
-
A model of opinion dynamics evolving via a preferential attachment mechanism involving multiple extractions
For a two-opinion preferential-attachment network with multiple sampling and general reinforcement, the normalized opinion count, influence capital and activity converge almost surely to invariant sets of a mean-field...
-
Voter model on heterogeneous directed networks
The paper conjectures that the expected consensus time on Pareto-directed configuration models scales as H(u) times a degree-sequence preconstant times n, for every tail exponent alpha>0.
Discussion (0). Sign in to comment.