SearcharxivSearch

arXiv · 1711.02589

Gene flow across geographical barriers - scaling limits of random walks with obstacles

Abstract

In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of crossing the barrier scales as $ 1/\sqrt{n} $ as we rescale space by $ \sqrt{n} $ and time by $ n $, we obtain a non trivial scaling limit which behaves like reflected Brownian motion until its local time at the origin reaches an independent exponential variable. It then follows reflected Brownian motion on the other side of the origin until its local time at the origin reaches another exponential level, and so on. We give a martingale problem characterisation of this process as well as another construction and an explicit formula for its transition density. This result has applications in the field of population genetics where such a random walk is used to trace the position of one's ancestor in the past in the presence of a barrier to gene flow.

Explore related subjects

Keep this discovery

BibTeXRIS

Raphael Forien. 2017-11-07. Gene flow across geographical barriers - scaling limits of random walks with obstacles. https://doi.org/10.1016/j.spa.2018.10.006

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