Sökning: "Galton-Watson branching processes"

Hittade 3 avhandlingar innehållade orden Galton-Watson branching processes.

  1. 1. A Multitype Branching Processes Approach to the Evolutionary Dynamics of Escape

    Författare :Maria Conceicao Serra; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Galton-Watson branching processes; multitype; decomposable processes; population dynamics; extinction; mutation; path to escape; waiting time to escape; Galton-Watson branching processes;

    Sammanfattning : Evolutionary dynamics of escape is a recent development in theoretical biology. It is an attempt to predict possible patterns of population dynamics for a certain strain of viruses placed in a hostile environment. The only way to escape extinction for the virus is to find a new form better adapted to the new environment. LÄS MER

  3. 2. Asymptotic distribution theory for some test statistics in autoregressive and Galton-Watson processes

    Författare :Rolf Larsson; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Feynman-Kac’ formula; Saddlepoint approximation.; matematisk statistik; Mathematical Statistics;

    Sammanfattning : In this thesis, we study asymptotic distributions of some unit root test statistics in autoregressive processes. We then generalize, at first to the situation when the true parameter value is close to one^(thenear integrated case), and secondly to the corresponding test problems in the Galton-Watson process (i.e. LÄS MER

  4. 3. Split Trees, Cuttings and Explosions

    Författare :Cecilia Holmgren; Svante Janson; Luc Devroye; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random Graphs; Random Trees; Split Trees; Renewal Theory; Binary Search Trees; Cuttings; Records; Tree Algorithms; Markov Chains; Galton-Watson Processes; MATHEMATICS; MATEMATIK; Mathematics; Matematik;

    Sammanfattning : This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. LÄS MER