Related papers: A recursive distribution equation for the stable t…
In this note, we provide a new characterization of Aldous' Brownian continuum random tree as the unique fixed point of a certain natural operation on continuum trees (which gives rise to a recursive distributional equation). We also show…
We introduce a new, relatively simple, line-breaking construction of the $\alpha$-stable tree which realises its random finite-dimensional distributions. This is a direct analogue of Aldous' line-breaking construction of the Brownian…
We embed Duquesne and Le Gall's stable tree into a binary compact continuum random tree (CRT) in a way that solves an open problem posed by Goldschmidt and Haas. This CRT can be obtained by applying a recursive construction method of…
Given a sequence $(M_{n},Q_{n})_{n\ge 1}$ of i.i.d. random variables with generic copy $(M,Q)$ such that $M$ is a regular $d\times d$ matrix and $Q$ takes values in $\mathbb{R}^{d}$, we consider the random difference equation (RDE)…
We study a natural fragmentation process of the so-called stable tree introduced by Duquesne and Le Gall, which consists in removing the nodes of the tree according to a certain procedure that makes the fragmentation self-similar with…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
Aldous and Bandyopadhyay have shown that each solution to a recursive distributional equation (RDE) gives rise to recursive tree process (RTP), which is a sort of Markov chain in which time has a tree-like structure and in which the state…
In this article we prove the bivariate uniqueness property for a particular ``max-type'' recursive distributional equation (RDE). Using the general theory developed by Aldous and Bandyopadhyay (2005) we then show that the corresponding…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…
Given a sequence $(M_{n},Q_{n})_{n\ge 1}$ of i.i.d.\ random variables with generic copy $(M,Q) \in GL(d, \R) \times \R^d$, we consider the random difference equation (RDE) $$ R_{n}=M_{n}R_{n-1}+Q_{n}, $$ $n\ge 1$, and assume the existence…
We give a simple new proof of a theorem of Duquesne, stating that the properly rescaled contour function of a critical aperiodic Galton-Watson tree, whose offspring distribution is in the domain of attraction of a stable law of index…
We define decorated $\alpha$-stable trees which are informally obtained from an $\alpha$-stable tree by blowing up its branchpoints into random metric spaces. This generalizes the $\alpha$-stable looptrees of Curien and Kortchemski, where…
Consider distributional fixed point equations of the form R =d f(C_i, R_i, 1 <= i <= N), where f(.) is a possibly random real valued function, N in {0, 1, 2, 3,...} U {infty}, {C_i}_{i=1}^N are real valued random weights and {R_i}_{i >= 1}…
We introduce a simple tree growth process that gives rise to a new two-parameter family of discrete fragmentation trees that extends Ford's alpha model to multifurcating trees and includes the trees obtained by uniform sampling from…
We give a new, simple construction of the $\alpha$-stable tree for $\alpha \in (1,2]$. We obtain it as the closure of an increasing sequence of $\mathbb{R}$-trees inductively built by gluing together line-segments one by one. The lengths of…
This paper has been withdrawn by the author because of finding a flaw in the proof of endogeny for the Frozen Percolation RDE which was one of two examples discussed in this paper. The other example is correct and can be obtained from the…
Given a recursive distributional equation (RDE) and a solution $\mu$ of it, we consider the tree indexed invariant process called the recursive tree process (RTP) with marginal $\mu$. We introduce a new type of bivariate uniqueness property…
For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…
We extend Goldie's implicit renewal theorem to the arithmetic case, which allows us to determine the tail behavior of the solution of various random fixed point equations. It turns out that the arithmetic and nonarithmetic cases are very…