14,722 research outputs found
Height process for super-critical continuous state branching process
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
Some properties of the range of super-Brownian motion
We consider a super-Brownian motion . 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 -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 is
capacity-equivalent to in , , and the range of , as
well as the support of the integrated super-Brownian excursion are
capacity-equivalent to in ,
Fragmentation at height associated to L\'{e}vy processes
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
By considering a continuous pruning procedure on Aldous's Brownian tree, we
construct a random variable 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 leaves
Asymptotics for the small fragments of the fragmentation at nodes
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 . This limit is increasing in
and discontinuous. In the -stable case the fragmentation is
self-similar with index , with and the results are
close to those Bertoin obtained for general self-similar fragmentations but
with an additional assumtion which is not fulfilled here
Recommended from our members
Can Apps Make Air Pollution Visible? Learning About Health Impacts Through Engagement with Air Quality Information
- …