Louigi Addario-Berry
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Louigi Addario-Berry has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Gábor Lugosi
Department of Economics and Business Pompeu Fabra University Barcelona Spain
7 shared publications - Luc Devroye
McGill University
5 shared publications - Serte Donderwinkel
University of Groningen
5 shared publications - Jessica Lin
Department of Mathematics and Statistics, McGill University, Montreal, Canada
4 shared publications - Roberto Imbuzeiro Oliveira
IMPA, Rio de Janeiro, Brazil
4 shared publications - Sanchayan Sen
Department of Mathematics Indian Institute of Science 2010
3 shared publications
Latest Publications
- Open Access
- 30 July 2026
- Published by Wiley in Random Structures & Algorithms
- Vol. 69 (1) , e70082
Random Friend Trees
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski (2004). Vertices are attached sequentially, one by one, by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random. This model has interesting emergent properties, such as a highly skewed degree sequence. In contrast to the preferential attachment model, these emergent phenomena stem from a local rather than a global attachment mechanism. The structure of the resulting tree is also strikingly different from both the preferential attachment tree and the uniform random recursive tree: every edge is incident to a macro‐hub of asymptotically linear degree, and with high probability all but at most vertices in a tree of size are leaves. We prove various results on the neighbourhood of fixed vertices and edges, and we study macroscopic properties such as the diameter and the degree distribution, providing insights into the overall structure of the tree. We also present a number of open questions on this model and related models.
- 30 July 2026
- Published by Wiley in Random Structures & Algorithms
- Vol. 69 (1) , e70082
Open AccessRandom Friend Trees
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski (2004). Vertices are attached sequentially, one by one, by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random. This model has interesting emergent properties, such as a highly skewed degree sequence. In contrast to the preferential attachment model, these emergent phenomena stem from a local rather than a global attachment mechanism. The structure of the resulting tree is also strikingly different from both the preferential attachment tree and the uniform random recursive tree: every edge is incident to a macro‐hub of asymptotically linear degree, and with high probability all but at most vertices in a tree of size are leaves. We prove various results on the neighbourhood of fixed vertices and edges, and we study macroscopic properties such as the diameter and the degree distribution, providing insights into the overall structure of the tree. We also present a number of open questions on this model and related models.
- Open Access
On exponentially height-penalized random trees
Given $n \in \mathbb{N}$ and $μ\in \mathbb{R}$, a $\textit{$μ$-height-biased tree of size $n$}$ is a random plane tree $\mathbf{\mathbf{T}}_n$ with $n$ vertices with law given by $\mathbb{P}(\mathbf{T}=t) \propto e^{-μh(t)}$, where $t$ ranges over fixed plane trees with $n$ vertices, and $h(t)$ is the height of $t$. Fix a sequence $(μ_n)_{n \ge 1}$ of real numbers, and for $n \ge 1$ let $\mathbf{T}_n$ be a $μ$-height-biased tree of size $n$. Durhuus and Ünel (2023) described the asymptotic behaviour of $h(\mathbf{T}_n)$ when $μ_n \equiv μ\in \mathbb{R}$ is fixed. In this work, we extend their results to arbitrary sequences of positive parameters depending on $n$. Most notably, we show that such a tree behaves like a height-biased Continuum Random Tree (CRT) when $μ_n$ is of order $1/\sqrt{n}$; that its height is asymptotically $(2π^2n/μ_n)^{1/3}$ when $μ_n$ is of larger order than $1/\sqrt{n}$ and of smaller order than $n$; and that its height converges to a fixed constant when $μ_n$ is of order at least $n$, with some random jumps under specific conditions on $μ_n$. We additionally prove various results on second order behaviours, and large deviation principles for the height, for different regimes of $μ_n$. Finally, we describe new statistics of these trees, covering their widths, their root degrees, and the local structure around their roots.Open AccessOn exponentially height-penalized random trees
Given $n \in \mathbb{N}$ and $μ\in \mathbb{R}$, a $\textit{$μ$-height-biased tree of size $n$}$ is a random plane tree $\mathbf{\mathbf{T}}_n$ with $n$ vertices with law given by $\mathbb{P}(\mathbf{T}=t) \propto e^{-μh(t)}$, where $t$ ranges over fixed plane trees with $n$ vertices, and $h(t)$ is the height of $t$. Fix a sequence $(μ_n)_{n \ge 1}$ of real numbers, and for $n \ge 1$ let $\mathbf{T}_n$ be a $μ$-height-biased tree of size $n$. Durhuus and Ünel (2023) described the asymptotic behaviour of $h(\mathbf{T}_n)$ when $μ_n \equiv μ\in \mathbb{R}$ is fixed. In this work, we extend their results to arbitrary sequences of positive parameters depending on $n$. Most notably, we show that such a tree behaves like a height-biased Continuum Random Tree (CRT) when $μ_n$ is of order $1/\sqrt{n}$; that its height is asymptotically $(2π^2n/μ_n)^{1/3}$ when $μ_n$ is of larger order than $1/\sqrt{n}$ and of smaller order than $n$; and that its height converges to a fixed constant when $μ_n$ is of order at least $n$, with some random jumps under specific conditions on $μ_n$. We additionally prove various results on second order behaviours, and large deviation principles for the height, for different regimes of $μ_n$. Finally, we describe new statistics of these trees, covering their widths, their root degrees, and the local structure around their roots. - Open Access
Infinite Schnyder Woods
It is well-known that any finite triangulation possesses a unique maximal Schnyder wood. We introduce Schnyder woods of infinite triangulations, and prove there exists a unique maximal Schnyder wood of any infinite triangulation with finite boundary, and of the uniform infinite half-planar triangulation. Furthermore, the maximal Schnyder wood of the uniform infinite planar triangulation is the limit of maximal Schnyder woods of large finite random triangulations. Several structural properties of infinite Schnyder woods are also described.
Open AccessInfinite Schnyder Woods
It is well-known that any finite triangulation possesses a unique maximal Schnyder wood. We introduce Schnyder woods of infinite triangulations, and prove there exists a unique maximal Schnyder wood of any infinite triangulation with finite boundary, and of the uniform infinite half-planar triangulation. Furthermore, the maximal Schnyder wood of the uniform infinite planar triangulation is the limit of maximal Schnyder woods of large finite random triangulations. Several structural properties of infinite Schnyder woods are also described.
- Open Access
Revisiting scaling limits for critical inhomogeneous random graphs with finite third moments
We consider the rank-1 inhomogeneous random graph in the Brownian regime in the critical window. Aldous studied the weights of the components, and showed that this ordered sequence converges in the $\ell^2$-topology to the ordered excursions of a Brownian motion with parabolic drift when appropriately rescaled (http://doi.org/10.1214/aop/1024404421), as the number of vertices $n$ tends to infinity. We show that, under the finite third moment condition, the same conclusion holds for the ordered component sizes. This in particular proves a result claimed by Bhamidi, Van der Hofstad and Van Leeuwaarden (https://doi.org/10.1214/EJP.v15-817). We also show that, for the large components, the ranking by component weights coincides with the ranking by component sizes with high probability as $n \to \infty$.Open AccessRevisiting scaling limits for critical inhomogeneous random graphs with finite third moments
We consider the rank-1 inhomogeneous random graph in the Brownian regime in the critical window. Aldous studied the weights of the components, and showed that this ordered sequence converges in the $\ell^2$-topology to the ordered excursions of a Brownian motion with parabolic drift when appropriately rescaled (http://doi.org/10.1214/aop/1024404421), as the number of vertices $n$ tends to infinity. We show that, under the finite third moment condition, the same conclusion holds for the ordered component sizes. This in particular proves a result claimed by Bhamidi, Van der Hofstad and Van Leeuwaarden (https://doi.org/10.1214/EJP.v15-817). We also show that, for the large components, the ranking by component weights coincides with the ranking by component sizes with high probability as $n \to \infty$. - Open Access
Scaling limits of multitype Bienaymé trees
We consider critical multitype Bienaymé trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first, conditioning on the value of a linear combination of the numbers of vertices of given types; and second, conditioning on the precise number of vertices belonging to a selected subset of types. We prove that, under a finite exponential moment condition, the scaling limit as the tree size tends to infinity is given by the Brownian Continuum Random Tree. Additionally, we establish strong non-asymptotic tail bounds for the height of such trees. Our main tools include a flattening operation applied to multitype trees and sharp estimates regarding the structure of monotype trees with a given sequence of degrees.
Open AccessScaling limits of multitype Bienaymé trees
We consider critical multitype Bienaymé trees that are either irreducible or possess a critical irreducible component with attached subcritical components. These trees are studied under two distinct conditioning frameworks: first, conditioning on the value of a linear combination of the numbers of vertices of given types; and second, conditioning on the precise number of vertices belonging to a selected subset of types. We prove that, under a finite exponential moment condition, the scaling limit as the tree size tends to infinity is given by the Brownian Continuum Random Tree. Additionally, we establish strong non-asymptotic tail bounds for the height of such trees. Our main tools include a flattening operation applied to multitype trees and sharp estimates regarding the structure of monotype trees with a given sequence of degrees.
- Open Access
Optimal root recovery for uniform attachment trees and $d$-regular growing trees
We consider root-finding algorithms for random rooted trees grown by uniform attachment. Given an unlabeled copy of the tree and a target accuracy $\varepsilon > 0$, such an algorithm outputs a set of nodes that contains the root with probability at least $1 - \varepsilon$. We prove that, for the optimal algorithm, an output set of size $\exp(O(\log^{1/2}(1/\varepsilon)))$ suffices; this bound is sharp and answers a question of Bubeck, Devroye and Lugosi (2017). We prove similar bounds for random regular trees that grow by uniform attachment, strengthening a result of Khim and Loh (2017).Open AccessOptimal root recovery for uniform attachment trees and $d$-regular growing trees
We consider root-finding algorithms for random rooted trees grown by uniform attachment. Given an unlabeled copy of the tree and a target accuracy $\varepsilon > 0$, such an algorithm outputs a set of nodes that contains the root with probability at least $1 - \varepsilon$. We prove that, for the optimal algorithm, an output set of size $\exp(O(\log^{1/2}(1/\varepsilon)))$ suffices; this bound is sharp and answers a question of Bubeck, Devroye and Lugosi (2017). We prove similar bounds for random regular trees that grow by uniform attachment, strengthening a result of Khim and Loh (2017). - Open Access
Leaf Stripping on Uniform Attachment Trees
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with probability $1 - ε$, the set of remaining vertices contains the root and has a size only depending on $ε$ but not on the size of the tree.Open AccessLeaf Stripping on Uniform Attachment Trees
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with probability $1 - ε$, the set of remaining vertices contains the root and has a size only depending on $ε$ but not on the size of the tree. - Open Access
The top eigenvalue of uniformly random trees
Let ${\mathbf T}_n$ be a uniformly random tree with vertex set $[n]=\{1,\ldots,n\}$, let $Δ_{{\mathbf T}_n}$ be the largest vertex degree in ${\mathbf T}_n$, and let $λ_1({\mathbf T}_n),\ldots,λ_n({\mathbf T}_n)$ be the eigenvalues of its adjacency matrix, arranged in decreasing order. We prove that $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}| \to 0$ in expectation as $n \to \infty$, and additionally prove probability tail bounds for $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}|$. Writing $a_n$ for any median of $Δ_{{\mathbf T}_n}$, we also prove that $|λ_k({\mathbf T}_n)-\sqrt{a_n}| \to 0$ in expectation, uniformly over $1 \le k \le e^{\log^β(n)}$, for any fixed $β\in (0,1/2)$. The proof is based on the trace method and thus on counting closed walks in a random tree. To this end, we develop novel combinatorial tools for encoding walks in trees that we expect will find other applications. In order to apply these tools, we show that uniformly random trees -- after appropriate "surgery" -- satisfy, with high probability, the properties required for the combinatorial bounds to be effective.Open AccessThe top eigenvalue of uniformly random trees
Let ${\mathbf T}_n$ be a uniformly random tree with vertex set $[n]=\{1,\ldots,n\}$, let $Δ_{{\mathbf T}_n}$ be the largest vertex degree in ${\mathbf T}_n$, and let $λ_1({\mathbf T}_n),\ldots,λ_n({\mathbf T}_n)$ be the eigenvalues of its adjacency matrix, arranged in decreasing order. We prove that $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}| \to 0$ in expectation as $n \to \infty$, and additionally prove probability tail bounds for $|λ_1({\mathbf T}_n)-\sqrt{Δ_{{\mathbf T}_n}}|$. Writing $a_n$ for any median of $Δ_{{\mathbf T}_n}$, we also prove that $|λ_k({\mathbf T}_n)-\sqrt{a_n}| \to 0$ in expectation, uniformly over $1 \le k \le e^{\log^β(n)}$, for any fixed $β\in (0,1/2)$. The proof is based on the trace method and thus on counting closed walks in a random tree. To this end, we develop novel combinatorial tools for encoding walks in trees that we expect will find other applications. In order to apply these tools, we show that uniformly random trees -- after appropriate "surgery" -- satisfy, with high probability, the properties required for the combinatorial bounds to be effective. - Open Access
Random friend trees
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random. This model has interesting emergent properties, such as a highly skewed degree sequence. In contrast to the preferential attachment model, these emergent phenomena stem from a local rather than a global attachment mechanism. The structure of the resulting tree is also strikingly different from both the preferential attachment tree and the uniform random recursive tree: every edge is incident to a macro-hub of asymptotically linear degree, and with high probability all but at most $n^{9/10}$ vertices in a tree of size $n$ are leaves. We prove various results on the neighbourhood of fixed vertices and edges, and we study macroscopic properties such as the diameter and the degree distribution, providing insights into the overall structure of the tree. We also present a number of open questions on this model and related models.Open AccessRandom friend trees
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saramäki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and connecting to one of its neighbours (or friends), chosen uniformly at random. This model has interesting emergent properties, such as a highly skewed degree sequence. In contrast to the preferential attachment model, these emergent phenomena stem from a local rather than a global attachment mechanism. The structure of the resulting tree is also strikingly different from both the preferential attachment tree and the uniform random recursive tree: every edge is incident to a macro-hub of asymptotically linear degree, and with high probability all but at most $n^{9/10}$ vertices in a tree of size $n$ are leaves. We prove various results on the neighbourhood of fixed vertices and edges, and we study macroscopic properties such as the diameter and the degree distribution, providing insights into the overall structure of the tree. We also present a number of open questions on this model and related models. - Open AccessRandom trees have height $O(\sqrt{n})$
We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three conjectures of Janson (2012) and answering several other questions from the literature. Moreover, we define a partial ordering on degree sequences and show that it induces a stochastic ordering on the heights of uniformly random trees with given degree sequences. The latter result can also be used to show that sub-binary random trees are stochastically the tallest trees with a given number of vertices and leaves (and thus that random binary trees are the stochastically tallest random homeomorphically irreducible trees with a given number of vertices). Our proofs are based in part on the bijection between trees and sequences introduced by Foata and Fuchs (1970), which can be recast to provide a line-breaking construction of random trees with given vertex degrees as shown in Addario-Berry, Blanc-Renaudie, Donderwinkel, Maazoun and Martin (2023).
Open AccessRandom trees have height $O(\sqrt{n})$We obtain new non-asymptotic tail bounds for the height of uniformly random trees with a given degree sequence, simply generated trees and conditioned Bienaym\'e trees (the family trees of branching processes), in the process settling three conjectures of Janson (2012) and answering several other questions from the literature. Moreover, we define a partial ordering on degree sequences and show that it induces a stochastic ordering on the heights of uniformly random trees with given degree sequences. The latter result can also be used to show that sub-binary random trees are stochastically the tallest trees with a given number of vertices and leaves (and thus that random binary trees are the stochastically tallest random homeomorphically irreducible trees with a given number of vertices). Our proofs are based in part on the bijection between trees and sequences introduced by Foata and Fuchs (1970), which can be recast to provide a line-breaking construction of random trees with given vertex degrees as shown in Addario-Berry, Blanc-Renaudie, Donderwinkel, Maazoun and Martin (2023).