Search arXivSearch

arXiv · 1707.04317

Infinite rate symbiotic branching on the real line: The tired frogs model

Abstract

Consider a population of infinitesimally small frogs on the real line. Initially the frogs on the positive half-line are dormant while those on the negative half-line are awake and move according to the heat flow. At the interface, the incoming wake frogs try to wake up the dormant frogs and succeed with a probability proportional to their amount among the total amount of involved frogs at the specific site. Otherwise, the incoming frogs also fall asleep. This frog model is a special case of the infinite rate symbiotic branching process on the real line with different motion speeds for the two types. We construct this frog model as the limit of approximating processes and compute the structure of jumps. We show that our frog model can be described by a stochastic partial differential equation on the real line with a jump type noise.

Explore related subjects

Keep this discovery

BibTeXRIS

Achim Klenke, Leonid Mytnik. 2017-07-13. Infinite rate symbiotic branching on the real line: The tired frogs model. https://arxiv.org/abs/1707.04317

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