相关论文: Limit laws for embedded trees. Applications to the…
We estimate the size of a labelled tree by comparing the amount of (labelled) nodes with the size of the set of labels. Roughly speaking, a exponentially big labelled tree, is any labelled tree that has an exponential gap between its size,…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…
We establish limit theorems that describe the asymptotic local and global geometric behaviour of random enriched trees considered up to symmetry. We apply these general results to random unlabelled weighted rooted graphs and uniform random…
We study restricted computation models related to the Tree Evaluation Problem}. The TEP was introduced in earlier work as a simple candidate for the (*very*) long term goal of separating L and LogDCFL. The input to the problem is a rooted,…
Random multiplicative processes $w_t =\lambda_1 \lambda_2 ... \lambda_t$ (with < \lambda_j > 0 ) lead, in the presence of a boundary constraint, to a distribution $P(w_t)$ in the form of a power law $w_t^{-(1+\mu)}$. We provide a simple and…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…
We introduce regenerative tree growth processes as consistent families of random trees with n labelled leaves, n>=1, with a regenerative property at branch points. This framework includes growth processes for exchangeably labelled Markov…
In this paper, we study a class of random walks that build their own tree. At each step, the walker attaches a random number of leaves to its current position. The model can be seen as a subclass of the Random Walk in Changing Environments…
We introduce a model of branching interlacements for general critical offspring distributions. It consists of a countable collection of infinite tree-indexed random walk trajectories on $Z^d,d\geq5$. We show that this model turns out to be…
We consider the problem of enumerating spanning trees on lattices. Closed-form expressions are obtained for the spanning tree generating function for a hypercubic lattice of size N_1 x N_2 x...x N_d in d dimensions under free, periodic, and…
We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressible as an existential monadic second order sentence (EMSO).…
We determine the limit of the expected value and the variance of the protection number of the root in simply generated trees, in P\'olya trees, and in unlabelled non-plane binary trees, when the number of vertices tends to infinity.…
We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…
We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of patterns, we propose an algorithm that outputs either an accurate…
We study nongeneric planar trees and prove the existence of a Gibbs measure on infinite trees obtained as a weak limit of the finite volume measures. It is shown that in the infinite volume limit there arises exactly one vertex of infinite…
We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…
For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…