SearcharxivSearch

arXiv · 0905.2310

Passage time from four to two blocks of opinions in the voter model and walks in the quarter plane

Abstract

A random walk in $Z_+^2$ spatially homogeneous in the interior, absorbed at the axes, starting from an arbitrary point $(i_0,j_0)$ and with step probabilities drawn on Figure 1 is considered. The trivariate generating function of probabilities that the random walk hits a given point $(i,j)\in Z_+^2$ at a given time $k\geq 0$ is made explicit. Probabilities of absorption at a given time $k$ and at a given axis are found, and their precise asymptotic is derived as the time $k\to\infty$. The equivalence of two typical ways of conditioning this random walk to never reach the axes is established. The results are also applied to the analysis of the voter model with two candidates and initially, in the population $Z$, four connected blocks of same opinions. Then, a citizen changes his mind at a rate proportional to the number of its neighbors that disagree with him. Namely, the passage from four to two blocks of opinions is studied.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Irina Kurkova, Kilian Raschel. 2013-07-03. Passage time from four to two blocks of opinions in the voter model and walks in the quarter plane. https://doi.org/10.1007/s11134-012-9333-7

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