Search

6 Jul 2023: 2016). In the statistics literature, tree-structured models were examined by Bühlmann (2000);Bühlmann and Wyner (1999). ... This is a generalisation ofthe “context tree maximizing” algorithm of Willems and Volf (1994).

15 Aug 2012: See Harris (1963)Ch. I; this book uses the more traditional name Galton–Watson process for thebranching process). ... τ 0k and the conducting edges between them. converges in some distributional sense as n to a family tree of a

21 Nov 2018: Cutoff for Random Walk on Dynamical Erdős-Rényi Graph. Perla Sousi Sam Thomas. Abstract. We consider dynamical percolation on the complete graph Kn, where each edge refreshes itsstate at rate µ 1/n, and is then declared open with probability p =

15 Aug 2012: Let T be the family-tree of a Galton–Watson branching process with a single progenitor 0, and we assume for simplicitythat every family-size is at least 1 and that ... We consider a (Galton–Watson) branching process with family-size