English
Related papers

Related papers: Sharp concentration for the largest and smallest f…

200 papers

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…

Probability · Mathematics 2026-03-12 Piotr Dyszewski , Samuel G. G. Johnston , Sandra Palau , Joscha Prochno

We study a Markovian model for the random fragmentation of an object. At each time, the state consists of a collection of blocks. Each block waits an exponential amount of time with parameter given by its size to some power $\alpha$,…

Probability · Mathematics 2016-08-11 Christina Goldschmidt , Bénédicte Haas

We consider point process convergence for sequences of iid random walks. The objective is to derive asymptotic theory for the largest extremes of these random walks. We show convergence of the maximum random walk to the Gumbel or the…

Probability · Mathematics 2020-11-10 Thomas Mikosch , Jorge Yslas

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…

Statistical Mechanics · Physics 2013-08-14 Jean-Yves Fortin , Sophie Mantelli , Moo Young Choi

The subject of this paper is a fragmentation equation with nonconservative solutions, some mass being lost to a dust of zero-mass particles as a consequence of an intensive splitting. Under some assumptions of regular variation on the…

Probability · Mathematics 2016-08-14 Bénédicte Haas

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…

Probability · Mathematics 2009-02-15 Christina Goldschmidt , Bénédicte Haas

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…

Probability · Mathematics 2019-12-11 Benjamin Dadoun

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…

Probability · Mathematics 2007-05-23 Jean Bertoin , Alexander Gnedin

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…

Probability · Mathematics 2020-10-26 Jean-Jil Duchamps

We study scaling limits of non-increasing Markov chains with values in the set of non-negative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We…

Probability · Mathematics 2012-01-06 Bénédicte Haas , Grégory Miermont

The main focus of this work is the asymptotic behavior of mass-conservative homogeneous fragmentations. Considering the logarithm of masses makes the situation reminiscent of branching random walks. The standard approach is to study {\bf…

Probability · Mathematics 2010-09-30 Nathalie Krell , Alain Rouault

A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the…

Probability · Mathematics 2012-08-17 Peggy Cénac , Brigitte Chauvin , Samuel Herrmann , Pierre Vallois

Herein, we analyze an efficient branching particle method for asymptotic solutions to a class of continuous-discrete filtering problems. Suppose that $t\to X_t$ is a Markov process and we wish to calculate the measure-valued process…

Probability · Mathematics 2007-05-23 Michael A. Kouritzin , Wei Sun

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

Probability · Mathematics 2015-07-28 Ágnes Backhausz , Balázs Szegedy

In the spirit of a classical results for Crump-Mode-Jagers processes, we prove a strong law of large numbers for homogenous fragmentation processes. Specifically, for self-similar fragmentation processes, including homogenous processes, we…

Probability · Mathematics 2008-09-18 S. C. Harris , R. Knobloch , A. E. Kyprianou

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…

Probability · Mathematics 2007-05-23 Romain Abraham , Jean-François Delmas

Homogeneous mass fragmentation processes describe the evolution of a unit mass that breaks down randomly into pieces as time. Mathematically speaking, they can be thought of as continuous-time analogues of branching random walks with…

Probability · Mathematics 2015-07-07 Andreas E. Kyprianou , Thomas Madaule

The self-similar growth-fragmentation equation describes the evolution of a medium in which particles grow and divide as time proceeds, with the growth and splitting of each particle depending only upon its size. The critical case of the…

Probability · Mathematics 2021-01-22 Jean Bertoin , Alexander R. Watson

We consider a Markovian evolution on point processes, the $\Psi$--process, on the unit interval in which points are added according to a rule that depends only on the spacings of the existing point configuration. Having chosen a spacing, a…

Probability · Mathematics 2020-07-01 Pascal Maillard , Elliot Paquette

Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…

Probability · Mathematics 2023-06-08 Emma Horton , Alexander R. Watson
‹ Prev 1 2 3 10 Next ›