相关论文: Galton-Watson Trees with the Same Mean Have the Sa…

Consider an arbitrary large population at the present time, originated at an unspecified arbitrary large time in the past, where individuals in the same generation reproduce independently, forward in time, with the same offspring…

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 study rooted planar random trees with a probability distribution which is proportional to a product of weight factors $w_n$ associated to the vertices of the tree and depending only on their individual degrees $n$. We focus on the case…

Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…

Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…

We consider a random walk on a Galton-Watson tree whose offspring distribution has a regular varying tail of order $\kappa\in (1,2)$. We prove the convergence of the renormalised height function of the walk towards the continuous-time…

A properly scaled critical Galton-Watson process converges to a continuous state critical branching process $\xi(\cdot)$ as the number of initial individuals tends to infinity. We extend this classical result by allowing for overlapping…

This paper contributes to a programme initiated by the first author: `How much information about a graph is revealed in its Potts partition function?'. We show that the $W$-polynomial distinguishes non-isomorphic weighted trees of a…

We give a characterization of the percolation threshold for a multirange model on oriented trees, as the first positive root of a polynomial, with the use of a multi-type Galton-Watson process. This gives in particular the exact value of…

We give a realization of the stable L\'evy forest of a given size conditioned by its mass from the path of the unconditioned forest. Then, we prove an invariance principle for this conditioned forest by considering $k$ independent…

We are interested in the biased random walk on a supercritical Galton--Watson tree in the sense of Lyons, Pemantle and Peres, and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random;…

Consider an inhomogeneous multi-species TASEP with drift to the left, and define a height function which equals the maximum species number to the left of a lattice site. For each fixed time, the multi-point distributions of these height…

When choosing a suitable technique for regression and classification with multivariate predictor variables, one is often faced with a tradeoff between interpretability and high predictive accuracy. To give a classical example,…

We study the additive functional $X_n(\alpha)$ on conditioned Galton-Watson trees given, for arbitrary complex $\alpha$, by summing the $\alpha$th power of all subtree sizes. Allowing complex $\alpha$ is advantageous, even for the study of…

A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…

Since the work of Aldous and Pitman (1998), several authors have studied the pruning processes of Galton-Watson trees and their continuous analogue L\'evy trees. L\"ohr, Voisin and Winter (2015) introduced the space of bi-measure…

The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…

Tree transductions are binary relations of finite trees. For tree transductions defined by non-deterministic top-down tree transducers, inclusion, equivalence and synthesis problems are known to be undecidable. Adding origin semantics to…

A necessary and sufficient condition for the almost sure existence of an absolutely continuous (with respect to the branching measure) exact Hausdorff measure on the boundary of a Galton--Watson tree is obtained. In the case where the…

In this article, we study concave recursions on trees, which appear widely in information theory through algorithms such as belief propagation, and in statistical mechanics through models on tree-like graphs, including the Ising model,…