Constructing Branching Trees of Geostatistical Simulations

2021 ◽  
Author(s):  
Margaret Armstrong ◽  
Juan Valencia ◽  
Guido Lagos ◽  
Xavier Emery
Keyword(s):  
Branching Trees

Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees

2017 ◽  
Vol 125 ◽  
pp. 41-45 ◽  
Author(s):  
Weiguang Peng ◽  
NingNing Peng ◽  
KengMeng Ng ◽  
Kazuyuki Tanaka ◽  
Yue Yang
Keyword(s):  
Optimal Depth ◽  
Branching Trees

scholarly journals A new family of Markov branching trees: the alpha-gamma model

2009 ◽  
Vol 14 (0) ◽  
pp. 400-430 ◽  
Author(s):  
Bo Chen ◽  
Daniel Ford ◽  
Matthias Winkel
Keyword(s):  
Gamma Model ◽  
New Family ◽  
Branching Trees

Clumping in multitype-branching trees

1996 ◽  
Vol 28 (04) ◽  
pp. 1034-1050
Author(s):  
J. Alfredo López-Mimbela ◽  
Anton Wakolbinger
Keyword(s):  
Partial Differential Equations ◽  
Differential Equations ◽  
Critical Dimension ◽  
Particle Systems ◽  
Partial Differential ◽  
Locally Finite ◽  
Linear Partial Differential Equations ◽  
Ergodic Properties ◽  
Branching Trees ◽  
The Individual

We investigate the ‘clumping versus local finiteness' behavior in the infinite backward tree for a class of branching particle systems in ℝd with symmetric stable migration and critical ‘genuine multitype' branching. Under mild assumptions on the branching we establish, by analysing certain ergodic properties of the individual ancestral process, a critical dimension d c such that the (measure-valued) tree-top is almost surely locally finite if and only if d > d c. This result is used to obtain L 1-norm asymptotics of a corresponding class of systems of non-linear partial differential equations.

scholarly journals Convergence Rates in the Implicit Renewal Theorem on Trees

2013 ◽  
Vol 50 (4) ◽  
pp. 1077-1088
Author(s):  
Predrag R. Jelenković ◽  
Mariana Olvera-Cravioto
Keyword(s):  
Fixed Point ◽  
Rate Of Convergence ◽  
Convergence Rates ◽  
Tail Asymptotics ◽  
Renewal Theorem ◽  
Branching Trees

We consider possibly nonlinear distributional fixed-point equations on weighted branching trees, which include the well-known linear branching recursion. In Jelenković and Olvera-Cravioto (2012), an implicit renewal theorem was developed that enables the characterization of the power-tail asymptotics of the solutions to many equations that fall into this category. In this paper we complement the analysis in our 2012 paper to provide the corresponding rate of convergence.

The Laplacian on rapidly branching trees

1996 ◽  
Vol 83 (1) ◽  
pp. 191-202 ◽  
Author(s):  
Koji Fujiwara
Keyword(s):  
Branching Trees

Morphology of branching trees related to entropy

1977 ◽  
Vol 29 (2) ◽  
pp. 179-184 ◽  
Author(s):  
Keith Horsfield
Keyword(s):  
Branching Trees

Generalized Markov branching trees

2017 ◽  
Vol 49 (1) ◽  
pp. 108-133
Author(s):  
Harry Crane
Keyword(s):  
Sample Size ◽  
Tree Species ◽  
Gene Tree ◽  
Sufficient Conditions ◽  
Statistical Properties ◽  
Branching Trees ◽  
Necessary And Sufficient ◽  
Branching Property ◽  
Fragmentation Trees ◽  
Family Of Distributions

Abstract Motivated by the gene tree/species tree problem from statistical phylogenetics, we extend the class of Markov branching trees to a parametric family of distributions on fragmentation trees that satisfies a generalized Markov branching property. The main theorems establish important statistical properties of this model, specifically necessary and sufficient conditions under which a family of trees can be constructed consistently as sample size grows. We also consider the question of attaching random edge lengths to these trees.

Sign in / Sign up

Export Citation Format

Share Document