ترغب بنشر مسار تعليمي؟ اضغط هنا

Parametrised branching processes: a functional version of Kesten & Stigum theorem

140   0   0.0 ( 0 )
 نشر من قبل Jean-Francois Marckert
 تاريخ النشر 2021
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Let $(Z_n,ngeq 0)$ be a supercritical Galton-Watson process whose offspring distribution $mu$ has mean $lambda>1$ and is such that $int x(log(x))_+ dmu(x)<+infty$. According to the famous Kesten & Stigum theorem, $(Z_n/lambda^n)$ converges almost surely, as $nto+infty$. The limiting random variable has mean~1, and its distribution is characterised as the solution of a fixed point equation. par In this paper, we consider a family of Galton-Watson processes $(Z_n(lambda), ngeq 0)$ defined for~$lambda$ ranging in an interval $Isubset (1, infty)$, and where we interpret $lambda$ as the time (when $n$ is the generation). The number of children of an individual at time~$lambda$ is given by $X(lambda)$, where $(X(lambda))_{lambdain I}$ is a c`adl`ag integer-valued process which is assumed to be almost surely non-decreasing and such that $mathbb E(X(lambda))=lambda >1$ for all $lambdain I$. This allows us to define $Z_n(lambda)$ the number of elements in the $n$th generation at time $lambda$. Set $W_n(lambda)= Z_n(lambda)/lambda^n$ for all $ngeq 0$ and $lambdain I$. We prove that, under some moment conditions on the process~$X$, the sequence of processes $(W_n(lambda), lambdain I)_{ngeq 0}$ converges in probability as~$n$ tends to infinity in the space of c`adl`ag processes equipped with the Skorokhod topology to a process, which we characterise as the solution of a fixed point equation.



قيم البحث

اقرأ أيضاً

615 - Jean Bertoin 2009
We are interested in the genealogical structure of alleles for a Bienayme-Galton-Watson branching process with neutral mutations (infinite alleles model), in the situation where the initial population is large and the mutation rate small. We shall es tablish that for an appropriate regime, the process of the sizes of the allelic sub-families converges in distribution to a certain continuous state branching process (i.e. a Jirina process) in discrete time. It^os excursion theory and the Leevy-It^o decomposition of subordinators provide fundamental insights for the results.
We introduce and study the dynamics of an emph{immortal} critical branching process. In the classic, critical branching process, particles give birth to a single offspring or die at the same rates. Even though the average population is constant in ti me, the ultimate fate of the population is extinction. We augment this branching process with immortality by positing that either: (a) a single particle cannot die, or (b) there exists an immortal stem cell that gives birth to ordinary cells that can subsequently undergo critical branching. We discuss the new dynamical aspects of this immortal branching process.
Community detection is considered for a stochastic block model graph of n vertices, with K vertices in the planted community, edge probability p for pairs of vertices both in the community, and edge probability q for other pairs of vertices. The ma in focus of the paper is on weak recovery of the community based on the graph G, with o(K) misclassified vertices on average, in the sublinear regime $n^{1-o(1)} leq K leq o(n).$ A critical parameter is the effective signal-to-noise ratio $lambda=K^2(p-q)^2/((n-K)q)$, with $lambda=1$ corresponding to the Kesten-Stigum threshold. We show that a belief propagation algorithm achieves weak recovery if $lambda>1/e$, beyond the Kesten-Stigum threshold by a factor of $1/e.$ The belief propagation algorithm only needs to run for $log^ast n+O(1) $ iterations, with the total time complexity $O(|E| log^*n)$, where $log^*n$ is the iterated logarithm of $n.$ Conversely, if $lambda leq 1/e$, no local algorithm can asymptotically outperform trivial random guessing. Furthermore, a linear message-passing algorithm that corresponds to applying power iteration to the non-backtracking matrix of the graph is shown to attain weak recovery if and only if $lambda>1$. In addition, the belief propagation algorithm can be combined with a linear-time voting procedure to achieve the information limit of exact recovery (correctly classify all vertices with high probability) for all $K ge frac{n}{log n} left( rho_{rm BP} +o(1) right),$ where $rho_{rm BP}$ is a function of $p/q$.
269 - K. B. Athreya , P. E. Ney 2011
T. E. Harris was a pioneer par excellence in many fields of probability theory. In this paper, we give a brief survey of the many fundamental contributions of Harris to the theory of branching processes, starting with his doctoral work at Princeton i n the late forties and culminating in his fundamental book The Theory of Branching Processes, published in 1963.
The decomposable branching processes are relatively less studied objects, particularly in the continuous time framework. In this paper, we consider various variants of decomposable continuous time branching processes. As usual practice in the theory of decomposable branching processes, we group various types into irreducible classes. These irreducible classes evolve according to the well-studied nondecomposable/ irreducible branching processes. And we investigate the time evolution of the population of various classes when the process is initiated by the other class particle(s). We obtained class-wise extinction probability and the time evolution of the population in the different classes. We then studied another peculiar type of decomposable branching process where any parent at the transition epoch either produces a random number of offspring, or its type gets changed (which may or may not be regarded as new offspring produced depending on the application). Such processes arise in modeling the content propagation of competing contents in online social networks. Here also, we obtain various performance measures. Additionally, we conjecture that the time evolution of the expected number of shares (different from the total progeny in irreducible branching processes) is given by the sum of two exponential curves corresponding to the two different classes.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا