Search arXivSearch

arXiv · 1502.04242

Classification of catalytic branching processes and structure of the criticality set

Abstract

We study a catalytic branching process (CBP) with any finite set of catalysts. This model describes a system of particles where the movement is governed by a Markov chain with arbitrary finite or countable state space and the branching may only occur at the points of catalysis. The results obtained generalize and strengthen those known in cases of CBP with a single catalyst and of branching random walk on d-dimensional integer lattice with a finite number of sources of particles generation. We propose to classify CBP with N catalysts as supercritical, critical or subcritical according to the value of the Perron root of a specified NxN matrix. Such classification agrees with the moment analysis performed here for local and total particles numbers. By introducing the criticality set C we also consider the influence of catalysts parameters on the process behavior. The proof is based on construction of auxiliary multi-type Bellman-Harris processes with the help of hitting times under taboo and on application of multidimensional renewal theorems. Keywords and phrases: catalytic branching process, classification, hitting times under taboo, moment analysis, multi-type Bellman-Harris process.

Explore related subjects

Keep this discovery

BibTeXRIS

Ekaterina Vl. Bulinskaya. 2015-02-14. Classification of catalytic branching processes and structure of the criticality set. https://doi.org/10.1137/s0040585x97t987314

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