Related papers: Self-similar fragmentations derived from the stabl…
We study the behaviour of a natural measure defined on the leaves of the genealogical tree of some branching processes, namely self-similar growth-fragmentation processes. Each particle, or cell, is attributed a positive mass that evolves…
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…
The purpose of this work is to describe a duality between a fragmentation associated to certain Dirichlet distributions and a natural random coagulation. The dual fragmentation and coalescent chains arising in this setting appear in the…
Let each point of a homogeneous Poisson process in R^d independently be equipped with a random number of stubs (half-edges) according to a given probability distribution mu on the positive integers. We consider translation-invariant schemes…
Scaling properties of time series are usually studied in terms of the scaling laws of empirical moments, which are the time average estimates of moments of the dynamic variable. Nonlinearities in the scaling function of empirical moments…
We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees…
What is the analogue of L\'evy processes for random surfaces? Motivated by scaling limits of random planar maps in random geometry, we introduce and study L\'evy looptrees and L\'evy maps. They are defined using excursions of general L\'evy…
We give a stochastic model for the fragmentation phase of a snow avalanche. We construct a fragmentation-branching process related to the avalanches, on the set of all fragmentation sizes introduced by J. Bertoin. A fractal property of this…
We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three…
We construct the analogue of the local time -- at a fixed point $x$ -- for Markov processes indexed by Levy trees. We start by proving that Markov processes indexed by Levy trees satisfy a special Markov property which can be thought as a…
This paper introduces stochastic processes that describe the evolution of systems of particles in which particles immigrate according to a Poisson measure and split according to a self-similar fragmentation. Criteria for existence and…
We study a model of random binary trees grown "by the leaves" in the style of Luczak and Winkler. If $\tau_n$ is a uniform plane binary tree of size $n$, Luczak and Winkler, and later explicitly Caraceni and Stauffer, constructed a measure…
This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite…
The stable under iterated tessellation (STIT) process is a stochastic process that produces a recursive partition of space with cut directions drawn independently from a distribution over the sphere. The case of random axis-aligned cuts is…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…
In this paper we construct a third order method for solving additively split autonomous stiff systems of ordinary differential equations. The constructed additive method is L-stable with respect to the implicit part and allows to use an…
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally used as a Bayesian nonparametric prior for relational modelling. It can hardly be applied to other learning tasks…
We introduce an algorithm for generating a random sequence of fragmentation trees, which we call the ancestral branching algorithm. This algorithm builds on the recursive partitioning structure of a tree and gives rise to an associated…
Stanley lists the class of Dyck paths where all returns to the axis are of odd length as one of the many objects enumerated by (shifted) Catalan numbers. By the standard bijection in this context, these special Dyck paths correspond to a…
A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…