中文
相关论文

相关论文: Number of Complete N-ary Subtrees on Galton-Watson…

200 篇论文

We introduce a simple technique for proving the transience of certain processes defined on the random tree $\mathcal{G}$ generated by a supercritical branching process. We prove the transience for once-reinforced random walks on…

概率论 · 数学 2007-05-23 Andrea Collevecchio

We study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

数学物理 · 物理学 2015-05-27 Svante Janson , Thordur Jonsson , Sigurdur Orn Stefansson

We consider Galton-Watson trees associated with a critical offspring distribution and conditioned to have exactly $n$ vertices. These trees are embedded in the real line by affecting spatial positions to the vertices, in such a way that the…

概率论 · 数学 2007-05-23 Jean-Francois Le Gall

We derive an upper bound for the annealed return probability for the simple random walk on supercritical Bienaym\'e-Galton-Watson trees. The bound decays subexponentially in time $t$ with $t^{1/3}$ in the exponent. It is valid for all…

概率论 · 数学 2026-03-04 Markus Heydenreich , Peter Müller , Sara Terveer

Given a branching random walk $(Z_n)_{n\geq0}$ on $\mathbb{R}$, let $Z_n(A)$ be the number of particles located in interval $A$ at generation $n$. It is well known (e.g., \cite{biggins}) that under some mild conditions, $Z_n(\sqrt…

概率论 · 数学 2020-12-02 Shuxiong Zhang

We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…

概率论 · 数学 2012-10-24 David A. Croydon , Takashi Kumagai

We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is…

概率论 · 数学 2017-12-15 Peter Braunsteins , Geoffrey Decrouez , Sophie Hautphenne

Given a gene tree and a species tree, ancestral configurations represent the combinatorially distinct sets of gene lineages that can reach a given node of the species tree. They have been introduced as a data structure for use in the…

种群与进化 · 定量生物学 2016-10-25 Filippo Disanto , Noah A. Rosenberg

Branching processes $(Z_n)_{n \ge 0}$ in a varying environment generalize the Galton-Watson process, in that they allow time-dependence of the offspring distribution. Our main results concern general criteria for a.s. extinction,…

概率论 · 数学 2019-11-11 Götz Kersting

We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…

概率论 · 数学 2017-06-20 Svante Janson

Branching Processes in Random Environment (BPREs) $(Z\_n:n\geq0)$ are the generalization of Galton-Watson processes where in each generation the reproduction law is picked randomly in an i.i.d. manner. In the supercritical regime, the…

概率论 · 数学 2017-01-06 Vincent Bansaye , Christian Boeinghoff

Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…

群论 · 数学 2015-02-12 Daniel C. Mayer

Consider a branching process $\{Z_n\}_{n\ge 0}$ with immigration in varying environment. For $a\in\{0,1,2,...\},$ let $C=\{n\ge0:Z_n=a\}$ be the collection of times at which the population size of the process attains level $a.$ We give a…

概率论 · 数学 2023-08-08 Hua-Ming Wang

This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive…

概率论 · 数学 2016-01-15 Cecilia Holmgren , Svante Janson

We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a rooted binary random tree $T_n$ with $n$ leaves. We focus on the case of subtrees of the Continuum Random Tree generated by uniform sampling of…

概率论 · 数学 2012-12-24 Patrick Hoscheit

In a Bienaym\'{e}-Galton-Watson process for which there is a positiveprobability for individuals of having no offspring, there is a subtlebalance and dependence between the sterile nodes (the dead nodes or leaves)and the prolific ones (the…

概率论 · 数学 2023-02-17 Thierry Huillet , Servet Martinez

We study the iterated Galton-Watson process (IGW), possibly with thinning, introduced by Gawe{\l}and Kimmel to model the number of repeats of DNA triplets during some genetic disorders. If the process involves some thinning, then extinction…

概率论 · 数学 2007-05-23 Didier Piau

We consider the genealogical tree of a stationary continuous state branching process with immigration. For a sub-critical stable branching mechanism, we consider the genealogical tree of the extant population at some fixed time and prove…

概率论 · 数学 2020-05-21 Romain Abraham , Jean-François Delmas , Hui He

Given a gene-tree labeled topology $G$ and a species tree $S$, the "ancestral configurations" at an internal node $k$ of $S$ represent the combinatorially different sets of gene lineages that can be present at $k$ when all possible…

We consider the quantity $P(G)$ associated with a graph $G$ that is defined as the probability that a randomly chosen subtree of $G$ is spanning. Motivated by conjectures due to Chin, Gordon, MacPhee and Vincent on the behaviour of this…

组合数学 · 数学 2019-10-17 Stephan Wagner