Related papers: Invariance principle for fragmentation processes d…
The $k$-cut number of rooted graphs was introduced by Cai et al. as a generalization of the classical cutting model by Meir and Moon. In this paper, we show that all moments of the k-cut number of conditioned Galton-Watson trees converges…
We analyze the fragmentation behavior of random clusters on the lattice under a process where bonds between neighboring sites are successively broken. Modeling such structures by configurations of a generalized Potts or random-cluster model…
We extend the results of Arguin et al and A\"\i{}d\'ekon et al on the convergence of the extremal process of branching Brownian motion by adding an extra dimension that encodes the "location" of the particle in the underlying Galton-Watson…
Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…
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…
We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…
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 consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…
The continuum random tree is the scaling limit of the uniform spanning tree on the complete graph with $N$ vertices. The Aldous-Broder chain on a graph $G=(V,E)$ is a discrete-time stochastic process with values in the space of rooted trees…
We introduce a random finite rooted tree $\mathcal{C}$, the steady state cluster, characterized by a recursive description: $\mathcal{C}$ is a singleton with probability $1/2$ and otherwise is obtained by joining by an edge the roots of two…
We construct a coupling between two seemingly very different constructions of the standard additive coalescent, which describes the evolution of masses merging pairwise at rates proportional to their sums. The first construction, due to…
Consider the motion of a charged, point particle moving in the complement of a Poisson distribution of hard sphere scatterers in two dimensions under the effect of a fixed magnetic field. Building on, and extending a coupling method…
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…
The incorporation of particle inertia into the usual mean field theory for particle aggregation and fragmentation in fluid flows is still an unsolved problem. We therefore suggest an alternative approach that is based on the dynamics of…
Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…
We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…
We explore statistical inference in self-similar conservative fragmentation chains when only approximate observations of the sizes of the fragments below a given threshold are available. This framework, introduced by Bertoin and Martinez…
We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…
We propose a framework for understanding the fragmentation criterion for self-gravitating discs which, in contrast to studies that emphasise the `gravoturbulent' nature of such discs, instead focuses on the properties of their quasi-regular…
Many phenomena can be modeled as network dynamics with punctuate interactions. However, most relevant dynamics do not allow for computational tractability. To circumvent this difficulty, the Poisson Hypothesis regime replaces interaction…