SearcharxivSearch

arXiv · 1607.06058

Perturbations of the Voter Model in One-Dimension

Abstract

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.

Explore related subjects

Keep this discovery

BibTeXRIS

C. M. Newman, K. Ravishankar, E. Schertzer. 2016-07-20. Perturbations of the Voter Model in One-Dimension. https://arxiv.org/abs/1607.06058

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR