Related papers: Decomposition of Levy trees along their diameter

R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the $n^{\mathrm{th}}$ tree is uniformly distributed over the set of rooted, planar, binary trees with $2n+1$ vertices. We obtain a…

In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…

After a short excursion from discovery of Brownian motion to the Richardson "law of four thirds" in turbulent diffusion, the article introduces the L\'{e}vy flight superdiffusion as a self-similar L\'{e}vy process. The condition of…

We discuss subordination of random compact R-trees. We focus on the case of the Brownian tree, where the subordination function is given by the past maximum process of Brownian motion indexed by the tree. In that particular case, the…

We prove that if $T_1,\dots, T_n$ is a sequence of bounded degree trees so that $T_i$ has $i$ vertices, then $K_n$ has a decomposition into $T_1,\dots, T_n$. This shows that the tree packing conjecture of Gy\'arf\'as and Lehel from 1976…

By using Bismut's approach about the Malliavin calculus with jumps, we study the regularity of the distributional density for SDEs driven by degenerate additive L\'evy noises. Under full H\"ormander's conditions, we prove the existence of…

Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs…

A continuous Markovian model for truncated Levy random walks is proposed. It generalizes the approach developed previously by Lubashevsky et al. Phys. Rev. E 79, 011110 (2009); 80, 031148 (2009), Eur. Phys. J. B 78, 207 (2010) allowing for…

In this work, we study a family of non-Markovian trees modeling populations where individuals live and reproduce independently with possibly time-dependent birth-rate and lifetime distribution. To this end, we use the coding process…

This work provide a thorough study of L\'evy or heavy-tailed random matrices (LM). By analysing the self-consistent equation on the probability distribution of the diagonal elements of the resolvent we establish the equation determining the…

We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…

Motivated by the study of random temporal networks, we introduce a class of random trees that we coin \emph{uniform temporal trees}. A uniform temporal tree is obtained by assigning independent uniform $[0,1]$ labels to the edges of a…

Let x and y be points chosen uniformly at random from $\Z_n^4$, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order $n^2 (\log n)^{1/6}$, resolving a…

We develop some theory of spinal decompositions of discrete and continuous fragmentation trees. Specifically, we consider a coarse and a fine spinal integer partition derived from spinal tree decompositions. We prove that for a…

A \emph{general branch-and-bound tree} is a branch-and-bound tree which is allowed to use general disjunctions of the form $\pi^{\top} x \leq \pi_0 \,\vee\, \pi^{\top}x \geq \pi_0 + 1$, where $\pi$ is an integer vector and $\pi_0$ is an…

The search for scale-invariant random geometries is central to the Asymptotic Safety hypothesis for the Euclidean path integral in quantum gravity. In an attempt to uncover new universality classes of scale-invariant random geometries that…

We study the ballistic L\'evy walk stemming from an infinite mean traveling time between collision events. Our study focuses on the density of spreading particles all starting from a common origin, which is limited by a `light' cone $-v_0…

We are interested in the structure of large Bienaym\'e-Galton-Watson random trees whose offspring distribution is critical and falls within the domain of attraction of a stable law of index $\alpha=1$. In stark contrast to the case $\alpha…

The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the…

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…