Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userVoter Model Perturbations and Reaction Diffusion Equations
138
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider particle systems that are perturbations of the voter model and show that when space and time are rescaled the system converges to a solution of a reaction diffusion equation in dimensions $d ge 3$. Combining this result with properties of the PDE, some methods arising from a low density super-Brownian limit theorem, and a block construction, we give general, and often asymptotically sharp, conditions for the existence of non-trivial stationary distributions, and for extinction of one type. As applications, we describe the phase diagrams of three systems when the parameters are close to the voter model: (i) a stochastic spatial Lotka-Volterra model of Neuhauser and Pacala, (ii) a model of the evolution of cooperation of Ohtsuki, Hauert, Lieberman, and Nowak, and (iii) a continuous time version of the non-linear voter model of Molofsky, Durrett, Dushoff, Griffeath, and Levin. The first application confirms a conjecture of Cox and Perkins and the second confirms a conjecture of Ohtsuki et al in the context of certain infinite graphs. An important feature of our general results is that they do not require the process to be attractive.
rate research
Read More
We study the scaling limit of a large class of voter model perturbations in one dimension, including stochastic Potts models, to a universal limiting object, the continuum voter model perturbation. The perturbations can be described in terms of bulk and boundary nucleations of new colors (opinions). The discrete and continuum (space) models are obtained from their respective duals, the discrete net with killing and Brownian net with killing. These determine the color genealogy by means of reduced graphs. We focus our attention on models where the voter and boundary nucleation dynamics depend only on the colors of nearest neighbor sites, for which convergence of the discrete net with killing to its continuum analog was proved in an earlier paper by the authors. We use some detailed properties of the Brownian net with killing to prove voter model perturbations convergence to its continuum counterpart. A crucial property of reduced graphs is that even in the continuum, they are finite almost surely. An important issue is how vertices of the continuum reduced graphs are strongly approximated by their discrete analogues.
We study the stability of reaction-diffusion equations in presence of noise. The relationship of stability of solutions between the stochastic ordinary different equations and the corresponding stochastic reaction-diffusion equation is firstly established. Then, by using the Lyapunov method, sufficient conditions for mean square and stochastic stability are given. The results show that the multiplicative noise can make the solution stable, but the additive noise will be not.
In this paper we develop a metastability theory for a class of stochastic reaction-diffusion equations exposed to small multiplicative noise. We consider the case where the unperturbed reaction-diffusion equation features multiple asymptotically stable equilibria. When the system is exposed to small stochastic perturbations, it is likely to stay near one equilibrium for a long period of time, but will eventually transition to the neighborhood of another equilibrium. We are interested in studying the exit time from the full domain of attraction (in a function space) surrounding an equilibrium and therefore do not assume that the domain of attraction features uniform attraction to the equilibrium. This means that the boundary of the domain of attraction is allowed to contain saddles and limit cycles. Our method of proof is purely infinite dimensional, i.e., we do not go through finite dimensional approximations. In addition, we address the multiplicative noise case and we do not impose gradient type of assumptions on the nonlinearity. We prove large deviations logarithmic asymptotics for the exit time and for the exit shape, also characterizing the most probable set of shapes of solutions at the time of exit from the domain of attraction.
Inspired by the spread of discontent as in the 2016 presidential election, we consider a voter model in which 0s are ordinary voters and 1s are zealots. Thinking of a social network, but desiring the simplicity of an infinite object that can have a nontrivial stationary distribution, space is represented by a tree. The dynamics are a variant of the biased voter: if $x$ has degree $d(x)$ then at rate $d(x)p_k$ the individual at $x$ consults $kge 1$ neighbors. If at least one neighbor is 1, they adopt state 1, otherwise they become 0. In addition at rate $p_0$ individuals with opinion 1 change to 0. As in the contact process on trees, we are interested in determining when the zealots survive and when they will survive locally.
We consider a reaction-diffusion equation of the type [ partial_tpsi = partial^2_xpsi + V(psi) + lambdasigma(psi)dot{W} qquadtext{on $(0,,infty)timesmathbb{T}$}, ] subject to a nice initial value and periodic boundary, where $mathbb{T}=[-1,,1]$ and $dot{W}$ denotes space-time white noise. The reaction term $V:mathbb{R}tomathbb{R}$ belongs to a large family of functions that includes Fisher--KPP nonlinearities [$V(x)=x(1-x)$] as well as Allen-Cahn potentials [$V(x)=x(1-x)(1+x)$], the multiplicative nonlinearity $sigma:mathbb{R}tomathbb{R}$ is non random and Lipschitz continuous, and $lambda>0$ is a non-random number that measures the strength of the effect of the noise $dot{W}$. The principal finding of this paper is that: (i) When $lambda$ is sufficiently large, the above equation has a unique invariant measure; and (ii) When $lambda$ is sufficiently small, the collection of all invariant measures is a non-trivial line segment, in particular infinite. This proves an earlier prediction of Zimmerman et al. (2000). Our methods also say a great deal about the structure of these invariant measures.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
