Related papers: Self-similar fragmentations derived from the stabl…

Recent fluctuation identities for $\alpha$-stable L\'evy processes have decomposed paths using generalised spherical polar coordinates revealing an underlying Markov Additive Process (MAP) for which a more advanced form of excursion theory…

We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…

A new class of random composition structures (the ordered analog of Kingman's partition structures) is defined by a regenerative description of component sizes. Each regenerative composition structure is represented by a process of random…

Spanning trees of low average stretch on the non-tree edges, as introduced by Alon et al. [SICOMP 1995], are a natural graph-theoretic object. In recent years, they have found significant applications in solvers for symmetric diagonally…

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

Recently introduced and studied in arXiv:2407.07888, a self-similar Markov tree (ssMt) is a random decorated tree that vastly generalises the fragmentation tree. We study here the critical case that was left aside in arXiv:2407.07888.…

The goal of this paper is to define and study a notion of fractional Brownian motion on a Lie group. We define it as at the solution of a stochastic differential equation driven by a linear fractional Brownian motion. We show that this…

Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, R\'acz, and Rashtchian used combinatorial…

This article investigates second order intertwinings between semigroups of birth-death processes and discrete gradients on the space of natural integers N. It goes one step beyond a recent work of Chafa{\"i} and Joulin which establishes and…

We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…

Using the concept of self-decomposable subordinators introduced in Gardini et al. [11], we build a new bivariate Normal Inverse Gaussian process that can capture stochastic delays. In addition, we also develop a novel path simulation scheme…

We derive a renormalization method to calculate the spectral dimension $\bar{d}$ of deterministic self-similar networks with arbitrary base units and branching constants. The generality of the method allows the affect of a multitude of…

We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…

We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a…

We generalize the celebrated coagulation-fragmentation duality of Pitman (1999), originally established for the PD$(\alpha,\theta)$ laws of Pitman and Yor (1997), resolving a two-decade open problem. Our framework extends the duality to…

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…

We develop an alternative approach to this field, which was to a large extent developed by Verbeure et al. It is meant to complement their approach, which is largely based on a non-commutative central limit theorem and coordinate space…

Stable distributions provide a flexible framework for modeling heavy-tailed and skewed data, with the stability index $\alpha$ quantifying tail heaviness. We propose a new semiparametric estimator for $\alpha$ that leverages the two-sum…

We consider a Brownian tree consisting of a collection of one-dimensional Brownian paths started from the origin, whose genealogical structure is given by the Continuum Random Tree (CRT). This Brownian tree may be generated from the…

We introduce root-to-leaf path random walks on double covers of graded signed graphs and analyze their behavior in a general setting. Viewing simplicial complexes within this framework, we show that these walks induce the natural…