Mean-field limit conjecture for the bias voter model on lattices

Let θ\theta be the bias parameter, θ<?\theta<\text{?}, and let θ\theta and θ\theta be the parameters appearing in the bias voter model on \dd\d^d; for p\a0in(0,1)p\a0in (0,1) and t>0t>0, consider the process ηt\eta_t started from initial distribution μp\mu_p. Mean-field limit conjecture. For p(0,1)p\in (0,1),

limd+PZdp(ηt(x)=1)=pe(λθ)t1p+pe(λθ)t\lim_{d\rightarrow+\infty}P_{\mathbb{Z}^d}^p(\eta_t(x)=1)=\frac{pe^{(\lambda-\theta)t}}{1-p+pe^{(\lambda-\theta)t}}

for any t>0t>0. This conjecture predicts convergence to the solution of the mean-field equation as the lattice dimension tends to infinity. The main difficulty identified in the source is proving asymptotic independence of neighboring sites; the conjecture remains open in the given text.

Sources & referencesView supporting material

Primary source

Xiaofeng Xue, “Mean field limit for bias voter model on regular trees”, arXiv:1512.00119 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.