اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSurvival of inhomogeneous Galton-Watson processes
124
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study survival properties of inhomogeneous Galton-Watson processes. We determine the so-called branching number (which is the reciprocal of the critical value for percolation) for these random trees (conditioned on being infinite), which turns out to be an a.s. constant. We also shed some light on the way the survival probability varies between the generations. When we perform independent percolation on the family tree of an inhomogeneous Galton-Watson process, the result is essentially a family of inhomogeneous Galton-Watson processes, parametrized by the retention probability $p$. We provide growth rates, uniformly in $p$, of the percolation clusters, and also show uniform convergence of the survival probability from the $n$-th level along subsequences. These results also establish, as a corollary, the supercritical continuity of the percolation function. Some of our results are generalisations of results by Lyons (1992).
قيم البحث
اقرأ أيضاً
Pruning processes $(mathcal{F}(theta),thetageq 0)$ have been studied separately for Galton-Watson trees and for Levy trees/forests. We establish here a limit theory that strongly connects the two studies. This solves an open problem by Abraham and De
lmas, also formulated as a conjecture by Lohr, Voisin and Winter. Specifically, we show that for any sequence of Galton-Watson forests $mathcal{F}_n$, $ngeq 1$, in the domain of attraction of a Levy forest $mathcal{F}$, suitably scaled pruning processes $(mathcal{F}_n(theta),thetageq 0)$ converge in the Skorohod topology on cadlag functions with values in the space of (isometry classes of) locally compact real trees to limiting pruning processes. We separately treat pruning at branch points and pruning at edges. We apply our results to study ascension times and Kesten trees and forests.
This paper deals with branching processes in varying environment, namely, whose offspring distributions depend on the generations. We provide sufficient conditions for survival or extinction which rely only on the first and second moments of the offs
pring distributions. These results are then applied to branching processes in varying environment with selection where every particle has a real-valued label and labels can only increase along genealogical lineages; we obtain analogous conditions for survival or extinction. These last results can be interpreted in terms of accessibility percolation on Galton-Watson trees, which represents a relevant tool for modeling the evolution of biological populations.
We are concerned with exploring the probabilities of first order statements for Galton-Watson trees with $Poisson(c)$ offspring distribution. Fixing a positive integer $k$, we exploit the $k$-move Ehrenfeucht game on rooted trees for this purpose. Le
t $Sigma$, indexed by $1 leq j leq m$, denote the finite set of equivalence classes arising out of this game, and $D$ the set of all probability distributions over $Sigma$. Let $x_{j}(c)$ denote the true probability of the class $j in Sigma$ under $Poisson(c)$ regime, and $vec{x}(c)$ the true probability vector over all the equivalence classes. Then we are able to define a natural recursion function $Gamma$, and a map $Psi = Psi_{c}: D rightarrow D$ such that $vec{x}(c)$ is a fixed point of $Psi_{c}$, and starting with any distribution $vec{x} in D$, we converge to this fixed point via $Psi$ because it is a contraction. We show this both for $c leq 1$ and $c > 1$, though the techniques for these two ranges are quite different.
The aim of this paper is to study rumor processes in random environment. In a rumor process a signal starts from the stations of a fixed vertex (the root) and travels on a graph from vertex to vertex. We consider two rumor processes. In the firework
process each station, when reached by the signal, transmits it up to a random distance. In the reverse firework process, on the other hand, stations do not send any signal but they listen for it up to a random distance. The first random environment that we consider is the deterministic 1-dimensional tree N with a random number of stations on each vertex; in this case the root is the origin of N. We give conditions for the survival/extinction on almost every realization of the sequence of stations. Later on, we study the processes on Galton-Watson trees with random number of stations on each vertex. We show that if the probability of survival is positive, then there is survival on almost every realization of the infinite tree such that there is at least one station at the root. We characterize the survival of the process in some cases and we give sufficient conditions for survival/extinction.
At each site of a supercritical Galton-Watson tree place a parking spot which can accommodate one car. Initially, an independent and identically distributed number of cars arrive at each vertex. Cars proceed towards the root in discrete time and park
in the first available spot they come to. Let $X$ be the total number of cars that arrive to the root. Goldschmidt and Przykucki proved that $X$ undergoes a phase transition from being finite to infinite almost surely as the mean number of cars arriving to each vertex increases. We show that $EX$ is finite at the critical threshold, describe its growth rate above criticality, and prove that it increases as the initial car arrival distribution becomes less concentrated. For the canonical case that either 0 or 2 cars arrive at each vertex of a $d$-ary tree, we give improved bounds on the critical threshold and show that $P(X = 0)$ is discontinuous.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
