Pruning Galton-Watson trees and tree-valued Markov processes (Q441242): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Let \(G_p\) be a Galton-Watson tree with offspring distribution \(p\) and \(u\in (0,1)\) be given. The authors introduce the following pruning-at-nodes procedure. If \(\nu\) is a non-leaf node of \(G_p\) that has \(n\) children, one discards this node along with all the subtrees emanating from it with probability \(u^{n-1}\) independently of the other nodes. The resulting tree is still a Galton-Watson tree with offspring distribution \(p^{(u)}\) defined by \(p_n^{(u)}:=u^{n-1}p_n\), \(n\in N\) and \(p_0^{(u)}:=1-\sum_{n\geq 1}p_n^{(u)}\). Using this procedure, the authors construct a tree-valued inhomogeneous Markov process \((G(u): u\in [0,\bar{u}])\) for some \(\bar{u}\geq 1\) such that, for every \(u\in [0,\bar{u}]\), \(G(u)\) is a Galton-Watson tree with offspring probability \(p^{(u)}\), and investigate its properties. Applying the same pruning-at-nodes procedure to a critical or a subcritical Galton-Watson tree conditioned on non-extinction, another tree-valued process \((G^\ast(u):u\in [0,1])\) is constructed. A representation is also given which relates the law of \((G(u))\) stopped at the first time the tree becomes infinite to the law of \((G^\ast(u))\). | |||
Property / review text: Let \(G_p\) be a Galton-Watson tree with offspring distribution \(p\) and \(u\in (0,1)\) be given. The authors introduce the following pruning-at-nodes procedure. If \(\nu\) is a non-leaf node of \(G_p\) that has \(n\) children, one discards this node along with all the subtrees emanating from it with probability \(u^{n-1}\) independently of the other nodes. The resulting tree is still a Galton-Watson tree with offspring distribution \(p^{(u)}\) defined by \(p_n^{(u)}:=u^{n-1}p_n\), \(n\in N\) and \(p_0^{(u)}:=1-\sum_{n\geq 1}p_n^{(u)}\). Using this procedure, the authors construct a tree-valued inhomogeneous Markov process \((G(u): u\in [0,\bar{u}])\) for some \(\bar{u}\geq 1\) such that, for every \(u\in [0,\bar{u}]\), \(G(u)\) is a Galton-Watson tree with offspring probability \(p^{(u)}\), and investigate its properties. Applying the same pruning-at-nodes procedure to a critical or a subcritical Galton-Watson tree conditioned on non-extinction, another tree-valued process \((G^\ast(u):u\in [0,1])\) is constructed. A representation is also given which relates the law of \((G(u))\) stopped at the first time the tree becomes infinite to the law of \((G^\ast(u))\). / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60J80 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6069310 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
branching process | |||
Property / zbMATH Keywords: branching process / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Galton-Watson process | |||
Property / zbMATH Keywords: Galton-Watson process / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random tree | |||
Property / zbMATH Keywords: random tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ascension process | |||
Property / zbMATH Keywords: ascension process / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Aleksander M. Iksanov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1007.0370 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fragmentation associated with Lévy processes using snake / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A continuum-tree-valued Markov process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The continuum random tree. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tree-valued Markov chains derived from Galton-Watson processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5674726 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subdiffusive behavior of random walk on a random cluster / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random trees and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-similar fragmentations derived from the stable tree. II: Splitting at nodes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Arbres et processus de Galton-Watson. (Trees and Galton-Watson processes) / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:38, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Pruning Galton-Watson trees and tree-valued Markov processes |
scientific article |
Statements
Pruning Galton-Watson trees and tree-valued Markov processes (English)
0 references
20 August 2012
0 references
Let \(G_p\) be a Galton-Watson tree with offspring distribution \(p\) and \(u\in (0,1)\) be given. The authors introduce the following pruning-at-nodes procedure. If \(\nu\) is a non-leaf node of \(G_p\) that has \(n\) children, one discards this node along with all the subtrees emanating from it with probability \(u^{n-1}\) independently of the other nodes. The resulting tree is still a Galton-Watson tree with offspring distribution \(p^{(u)}\) defined by \(p_n^{(u)}:=u^{n-1}p_n\), \(n\in N\) and \(p_0^{(u)}:=1-\sum_{n\geq 1}p_n^{(u)}\). Using this procedure, the authors construct a tree-valued inhomogeneous Markov process \((G(u): u\in [0,\bar{u}])\) for some \(\bar{u}\geq 1\) such that, for every \(u\in [0,\bar{u}]\), \(G(u)\) is a Galton-Watson tree with offspring probability \(p^{(u)}\), and investigate its properties. Applying the same pruning-at-nodes procedure to a critical or a subcritical Galton-Watson tree conditioned on non-extinction, another tree-valued process \((G^\ast(u):u\in [0,1])\) is constructed. A representation is also given which relates the law of \((G(u))\) stopped at the first time the tree becomes infinite to the law of \((G^\ast(u))\).
0 references
branching process
0 references
Galton-Watson process
0 references
random tree
0 references
ascension process
0 references