Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Williams Bjerknes Model on Regular Trees (1211.5694v2)

Published 24 Nov 2012 in math.PR, cs.SI, math-ph, and math.MP

Abstract: We consider the Williams Bjerknes model, also known as the biased voter model on the $d$-regular tree $\bbTd$, where $d \geq 3$. Starting from an initial configuration of "healthy" and "infected" vertices, infected vertices infect their neighbors at Poisson rate $\lambda \geq 1$, while healthy vertices heal their neighbors at Poisson rate 1. All vertices act independently. It is well known that starting from a configuration with a positive but finite number of infected vertices, infected vertices will continue to exist at all time with positive probability iff $\lambda > 1$. We show that there exists a threshold $\lambda_c \in (1, \infty)$ such that if $\lambda > \lambda_c$ then in the above setting with positive probability all vertices will become eventually infected forever, while if $\lambda < \lambda_c$, all vertices will become eventually healthy with probability 1. In particular, this yields a complete convergence theorem for the model and its dual, a certain branching coalescing random walk on $\bbTd$ -- above $\lambda_c$. We also treat the case of initial configurations chosen according to a distribution which is invariant or ergodic with respect to the group of automorphisms of $\bbTd$.

Citations (5)

Summary

We haven't generated a summary for this paper yet.