SearcharxivSearch

arXiv · 1612.06408

Colonization and collapse on Homogeneous Trees

Abstract

We investigate a basic immigration process where colonies grow, during a random time, according to a general counting process until collapse. Upon collapse a random amount of individuals survive. These survivors try independently establishing new colonies at neighbour sites. Here we consider this general process subject to two schemes, Poisson growth with geometric catastrophe and Yule growth with binomial catastrophe. Independent of everything else colonies growth, during an exponential time, as a Poisson (or Yule) process and right after that exponential time their size is reduced according to geometric (or binomial) law. Each survivor tries independently, to start a new colony at a neighbour site of a homogeneous tree. That colony will thrive until its collapse, and so on. We study conditions on the set of parameters for these processes to survive, present relevant bounds for the probability of survival, for the number of vertices that were colonized and for the reach of the colonies compared to the starting point.

Explore related subjects

Keep this discovery

BibTeXRIS

Valdivino V. Junior, Fábio P. Machado, Alejandro Roldán-Correa. 2016-12-19. Colonization and collapse on Homogeneous Trees. https://arxiv.org/abs/1612.06408

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