SearcharxivSearch

arXiv · 2107.06654

Quasi-processes for branching Markov chains

Abstract

Potential theory is a central tool to understand and analyse Markov processes. In this article, we develop its probabilistic counterpart for branching Markov chains. Specifically, we examine versions of quasi-processes or interlacements that incorporate branching, referred to as branching quasi-processes. These processes are characterized by their occupation measures. If a certain decorability condition is fulfilled, there's an isomorphism between the set of branching quasi-processes and the set of excessive measures, where the excessive measures correspond to the occupation measures of the branching quasi-processes. Utilizing a branching quasi-process as an intensity measure for a Poisson point process leads to the formulation of random interlacements with branching. In cases where individuals reproduce with an average rate of one or less, we detail a construction that draws on classical interlacements. Our approach significantly employs the additive structure of branching Markov chains, with the spinal representation of the branching processes serving as a crucial technical tool.

Explore related subjects

Keep this discovery

BibTeXRIS

Steffen Dereich, Martin Maiwald. 2021-07-14. Quasi-processes for branching Markov chains. https://arxiv.org/abs/2107.06654

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