Related papers: Asymptotics for the small fragments of the fragmen…
We provide the exact large-time behavior of the tail distribution of the extinction time of a self-similar fragmentation process with a negative index of self-similarity, improving thus a previous result on the logarithmic asymptotic…
Given any regularly varying dislocation measure, we identify a natural self-similar fragmentation tree as scaling limit of discrete fragmentation trees with unit edge lengths. As an application, we obtain continuum random tree limits of…
Markovian growth-fragmentation processes introduced by Bertoin extend the pure fragmentation model by allowing the fragments to grow larger or smaller between dislocation events. What becomes of the known asymptotic behaviors of…
We consider a self-similar fragmentation process in which the generic particle of size $x$ is replaced at probability rate $x^\alpha$, by its offspring made of smaller particles, where $\alpha$ is some positive parameter. The total of…
The stable fragmentation with index of self-similarity $\alpha \in [-1/2,0)$ is derived by looking at the masses of the subtrees formed by discarding the parts of a $(1 + \alpha)^{-1}$--stable continuum random tree below height $t$, for $t…
We calculate the mean and almost-sure leading order behaviour of the high frequency asymptotics of the eigenvalue counting function associated with the natural Dirichlet form on $\alpha$-stable trees, which lead in turn to short-time heat…
In this paper we prove a strong law of large numbers and its L^1-convergence counterpart for the process counted with a random characteristic in the context of self-similar fragmentation processes. This result extends a somewhat analogical…
We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behaviours of the shattering times, defined as the first instants when all the blocks of…
We study a random fragmentation process and its associated random tree. The process has earlier been studied by Dean and Majumdar (J. Phys. A: Math. Gen., vol. 35, L501--L507), who found a phase transition: the number of fragmentations is…
We study large deviation asymptotics for processes defined in terms of continued fraction digits. We use the continued fraction digit sum process to define a stopping time and derive a joint large deviation asymptotic for the upper and…
The basic object we consider is a certain model of continuum random tree, called the stable tree. We construct a fragmentation process $(F^-(t), t>=0)$ out of this tree by removing the vertices located under height $t$. Thanks to a…
We provide asymptotic results and develop high frequency statistical procedures for time-changed L\'evy processes sampled at random instants. The sampling times are given by first hitting times of symmetric barriers whose distance with…
We study a self-similar fragmentation process with dislocation measure $\nu$ and self-similarity index $\alpha > 0$. Let $e^{-m_t}$ denote the size of the largest fragment at time $t \geq 0$. For dislocation measures satisfying a regularity…
We derive the asymptotic distribution of the total length $L_n$ of a $\operatorname {Beta}(2-\alpha,\alpha)$-coalescent tree for $1<\alpha<2$, starting from $n$ individuals. There are two regimes: If $\alpha\le1/2(1+\sqrt{5})$, then $L_n$…
We consider fragmentation processes with values in the space of marked partitions of $\mathbb{N}$, i.e. partitions where each block is decorated with a nonnegative real number. Assuming that the marks on distinct blocks evolve as…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
Fragmentation and growth-fragmentation equations is a family of problems with varied and wide applications. This paper is devoted to description of the long time time asymptotics of two critical cases of these equations, when the division…
The growth-fragmentation equation models systems of particles that grow and split as time proceeds. An important question concerns the large time asymptotic of its solutions. Doumic and Escobedo ($2016$) observed that when growth is a…
We study the general fragmentation process starting from one element of size unity (E=1). At each elementary step, each existing element of size $E$ can be fragmented into $k\,(\ge 2)$ elements with probability $p_k$. From the continuous…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…