Mean-field limit conjecture for the bias voter model on lattices
Mean-field limit conjecture for the bias voter model on lattices
Let be the bias parameter, , and let and be the parameters appearing in the bias voter model on ; for and , consider the process started from initial distribution . Mean-field limit conjecture. For ,
for any . 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.