Search
Search Funnelback University
11 -
14 of
14
search results for `Galton Watson tree`
Fully-matching results
-
Time series modelling and inference with Bayesian Context Trees
www-sigproc.eng.cam.ac.uk/foswiki/pub/Main/IP307/thesis_ip307.pdf6 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). -
elec.dvi
www.statslab.cam.ac.uk/~grg/papers/USelec.pdf15 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 -
Cutoff for Random Walk on Dynamical Erdős-Rényi Graph Perla ...
www.statslab.cam.ac.uk/~ps422/ER_Annealed.pdf21 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 = -
rctree.dvi
www.statslab.cam.ac.uk/~grg/papers/USrctree.pdf15 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
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.