We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive probabilistic identities, bounds, and growth procedures for random trees with given degrees, including random d-ary trees. We also introduce a partial order on the degree sequences of rooted trees, and conjecture that it induces a stochastic partial order on heights of random rooted trees with given degrees.Comment: 11 pages, 2 figure
Bukh and Conlon used random polynomial graphs to give effective lower bounds on $\mathrm{ex}(n,\math...
AbstractWe give a new proof of Cayley's formula, which states that the number of labeled trees on n ...
This thesis is presented in two parts. In the first part, we study a family of models of random par...
AbstractWe construct a family of extremely simple bijections that yield Cayley's famous formula for ...
AbstractFor labeled trees, Rényi showed that the probability that an arbitrary point of a random tre...
In this paper, we explore some of the methods that are often used to solve combinatorial problems by...
In this paper, we explore some of the methods that are often used to solve combinatorial problems by...
AbstractWe give a new proof of Cayley's formula, which states that the number of labeled trees on n ...
Consider a Crump-Mode-Jagers process generated by an increasing random walk whose increments have fi...
In this paper we solve two problems of Esperet, Kang and Thomasse as well as Li concerning (i) induc...
AbstractIn 1889, A. Cayley stated that the number of forests with n labeled vertices that consist of...
AbstractSimple families of increasing trees can be constructed from simply generated tree families, ...
AbstractThe class ⊤ of binary search trees is studied. A leaf is a vertex of degree 0; ⊤n is the sub...
. We study binary search trees constructed from Weyl sequences fn`g; n 1, where ` is an irrational ...
AbstractIn this paper we study random induced subgraphs of Cayley graphs of the symmetric group indu...
Bukh and Conlon used random polynomial graphs to give effective lower bounds on $\mathrm{ex}(n,\math...
AbstractWe give a new proof of Cayley's formula, which states that the number of labeled trees on n ...
This thesis is presented in two parts. In the first part, we study a family of models of random par...
AbstractWe construct a family of extremely simple bijections that yield Cayley's famous formula for ...
AbstractFor labeled trees, Rényi showed that the probability that an arbitrary point of a random tre...
In this paper, we explore some of the methods that are often used to solve combinatorial problems by...
In this paper, we explore some of the methods that are often used to solve combinatorial problems by...
AbstractWe give a new proof of Cayley's formula, which states that the number of labeled trees on n ...
Consider a Crump-Mode-Jagers process generated by an increasing random walk whose increments have fi...
In this paper we solve two problems of Esperet, Kang and Thomasse as well as Li concerning (i) induc...
AbstractIn 1889, A. Cayley stated that the number of forests with n labeled vertices that consist of...
AbstractSimple families of increasing trees can be constructed from simply generated tree families, ...
AbstractThe class ⊤ of binary search trees is studied. A leaf is a vertex of degree 0; ⊤n is the sub...
. We study binary search trees constructed from Weyl sequences fn`g; n 1, where ` is an irrational ...
AbstractIn this paper we study random induced subgraphs of Cayley graphs of the symmetric group indu...
Bukh and Conlon used random polynomial graphs to give effective lower bounds on $\mathrm{ex}(n,\math...
AbstractWe give a new proof of Cayley's formula, which states that the number of labeled trees on n ...
This thesis is presented in two parts. In the first part, we study a family of models of random par...