Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userMaximal Branching Processes in Random Environment
122
0
0.0
(
0
)
Authors
Alexey V. Lebedev
Ask ChatGPT about the research
No Arabic abstract
The work continues the authors many-year research in theory of maximal branching processes, which are obtained from classical branching processes by replacing the summation of descendant numbers with taking the maximum. One can say that in each generation, descendants of only one particle survive, namely those of the particle that has the largest number of descendants. Earlier, the author generalized processes with integer values to processes with arbitrary nonnegative values, investigated their properties, and proved limit theorems. Then processes with several types of particles were introduced and studied. In the present paper we introduce the notion of maximal branching processes in random environment (with a single type of particles) and an important case of a power-law random environment. In the latter case, properties of maximal branching processes are studied and the ergodic theorem is proved. As applications, we consider gated infinite-server queues.
rate research
Read More
We consider the branching process in random environment ${Z_n}_{ngeq 0}$, which is a~population growth process where individuals reproduce independently of each other with the reproduction law randomly picked at each generation. We focus on the supercritical case, when the process survives with a positive probability and grows exponentially fast on the nonextinction set. Our main is goal is establish Fourier techniques for this model, which allow to obtain a number of precise estimates related to limit theorems. As a consequence we provide new results concerning central limit theorem, Edgeworth expansions and renewal theorem for $log Z_n$.
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. This model is known to exhibit a phase transition: If $d ge 3$ and the environment is not too random, then, the total population grows as fast as its expectation with strictly positive probability. If,on the other hand, $d le 2$, or the environment is ``random enough, then the total population grows strictly slower than its expectation almost surely. We show the equivalence between the slow population growth and a natural localization property in terms of replica overlap. We also prove a certain stronger localization property, whenever the total population grows strictly slower than its expectation almost surely.
We study survival of nearest-neighbour branching random walks in random environment (BRWRE) on ${mathbb Z}$. A priori there are three different regimes of survival: global survival, local survival, and strong local survival. We show that local and strong local survival regimes coincide for BRWRE and that they can be characterized with the spectral radius of the first moment matrix of the process. These results are generalizations of the classification of BRWRE in recurrent and transient regimes. Our main result is a characterization of global survival that is given in terms of Lyapunov exponents of an infinite product of i.i.d. $2times 2$ random matrices.
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit theorem for the density of the population, together with upper bounds for the density of the most populated site and the replica overlap. We also discuss the phase transition of this model in connection with directed polymers in random environment.
Using a high performance computer cluster, we run simulations regarding an open problem about d-dimensional critical branching random walks in a random IID environment The environment is given by the rule that at every site independently, with probability p>0, there is a cookie, completely suppressing the branching of any particle located there. Abstract. The simulations suggest self averaging: the asymptotic survival probability in n steps is the same in the annealed and the quenched case; it is frac{2}{qn}, where q:=1-p. This particular asymptotics indicates a non-trivial phenomenon: the tail of the survival probability (both in the annealed and the quenched case) is the same as in the case of non-spatial unit time critical branching, where the branching rule is modified: branching only takes place with probability q for every particle at every iteration.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
