1,335 research outputs found

    Some properties of the range of super-Brownian motion

    Full text link
    We consider a super-Brownian motion XX. Its canonical measures can be studied through the path-valued process called the Brownian snake. We obtain the limiting behavior of the volume of the ϵ\epsilon-neighborhood for the range of the Brownian snake, and as a consequence we derive the analogous result for the range of super-Brownian motion and for the support of the integrated super-Brownian excursion. Then we prove the support of XtX_t is capacity-equivalent to [0,1]2[0,1]^2 in Rd\R^d, d≥3d\geq 3, and the range of XX, as well as the support of the integrated super-Brownian excursion are capacity-equivalent to [0,1]4[0,1]^4 in Rd\R^d, d≥5d\geq 5

    Height process for super-critical continuous state branching process

    Get PDF
    We define the height process for super-critical continuous state branching processes with quadratic branching mechanism. It appears as a projective limit of Brownian motions with positive drift reflected at 0 and a>0 as a goes to infinity. Then we extend the pruning procedure of branching processes to the super-critical case. This give a complete duality picture between pruning and size proportional immigration for quadratic continuous state branching processes

    Fragmentation at height associated to L\'{e}vy processes

    Get PDF
    We consider the height process of a L\'{e}vy process with no negative jumps, and its associated continuous tree representation. Using tools developed by Duquesne and Le Gall, we construct a fragmentation process at height, which generalizes the fragmentation at height of stable trees given by Miermont. In this more general framework, we recover that the dislocation measures are the same as the dislocation measures of the fragmentation at node introduced by Abraham and Delmas, up to a factor equal to the fragment size. We also compute the asymptotic for the number of small fragments

    Record process on the Continuum Random Tree

    Get PDF
    By considering a continuous pruning procedure on Aldous's Brownian tree, we construct a random variable Θ\Theta which is distributed, conditionally given the tree, according to the probability law introduced by Janson as the limit distribution of the number of cuts needed to isolate the root in a critical Galton-Watson tree. We also prove that this random variable can be obtained as the a.s. limit of the number of cuts needed to cut down the subtree of the continuum tree spanned by nn leaves

    Asymptotics for the small fragments of the fragmentation at nodes

    Get PDF
    We consider the fragmentation at nodes of the L\'{e}vy continuous random tree introduced in a previous paper. In this framework we compute the asymptotic for the number of small fragments at time θ\theta. This limit is increasing in θ\theta and discontinuous. In the α\alpha-stable case the fragmentation is self-similar with index 1/α1/\alpha, with α∈(1,2)\alpha \in (1,2) and the results are close to those Bertoin obtained for general self-similar fragmentations but with an additional assumtion which is not fulfilled here

    Changing the branching mechanism of a continuous state branching process using immigration

    Get PDF
    We construct a continuous state branching process with immigration (CBI) whose immigration depends on the CBI itself and we recover a continuous state branching process (CB). This provides a dual construction of the pruning at nodes of CB introduced by the authors in a previous paper. This construction is a natural way to model neutral mutation. Using exponential formula, we compute the probability of extinction of the original type population in a critical or sub-critical quadratic branching, conditionally on the non extinction of the total population

    The forest associated with the record process on a L\'evy tree

    Full text link
    We perform a pruning procedure on a L\'evy tree and instead of throwing away the removed sub-tree, we regraft it on a given branch (not related to the L\'evy tree). We prove that the tree constructed by regrafting is distributed as the original L\'evy tree, generalizing a result where only Aldous's tree is considered. As a consequence, we obtain that the quantity which represents in some sense the number of cuts needed to isolate the root of the tree, is distributed as the height of a leaf picked at random in the L\'evy tree
    • …
    corecore