Related papers: Local convergence of critical random trees and con…
Using the theory of negative association for measures and the notion of random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically…
We consider the branch-length estimation problem on a bifurcating tree: a character evolves along the edges of a binary tree according to a two-state symmetric Markov process, and we seek to recover the edge transition probabilities from…
The Horton-Strahler number -- also called the register function -- is a combinatorial tool that quantifies the branching complexity of a rooted tree. We study the law of the Horton-Strahler number of stable Galton-Watson trees conditioned…
P\'olya trees are rooted trees considered up to symmetry. We establish the convergence of large uniform random P\'olya trees with arbitrary degree restrictions to Aldous' Continuum Random Tree with respect to the Gromov-Hausdorff metric.…
We investigate scaling limits of trees built by uniform attachment with freezing, which is a variant of the classical model of random recursive trees introduced in a companion paper. Here vertices are allowed to freeze, and arriving…
It is well known that the behaviour of a branching process is completely described by the generating function of the offspring law and its fixed points. Branching random walks are a natural generalization of branching processes: a branching…
In this article, we define the new concept of local coupling property for Markov processes and study its relationship with distributional properties of the transition probability. In the special case of L\'evy processes we show that this…
We consider a continuous-time vertex reinforced jump process on a supercritical Galton-Watson tree. This process takes values in the set of vertices of the tree and jumps to a neighboring vertex with rate proportional to the local time at…
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…
In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random…
We present a construction of a L\'evy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov's theorem. We also extend the pruning procedure to…
A general continuous-state branching processes in random environment (CBRE-process) is defined as the strong solution of a stochastic integral equation. The environment is determined by a L\'evy process with no jump less than $-1$. We give…
We use local limits of Galton-Watson trees to establish local limit theorems for permutations conditioned to avoid a pattern of length three. In the case of 321-avoiding permutations our results resolve an open problem of Pinsky. In the…
We study the supercritical contact process on Galton-Watson trees and periodic trees. We prove that if the contact process survives weakly then it dominates a supercritical Crump-Mode-Jagers branching process. Hence the number of infected…
We derive characteristic function identities for conditional distributions of an r-trimmed Levy process given its r largest jumps up to a designated time t. Assuming the underlying Levy process is in the domain of attraction of a stable…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…