The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
Louigi Addario-Berry, Serte Donderwinkel, Micka\"el Maazoun, James, Martin

TL;DR
This paper provides a simple bijective proof of Cayley's formula, explores its probabilistic applications in analyzing random trees, and introduces a partial order on tree degree sequences with conjectured stochastic properties.
Contribution
It introduces a simple bijective proof of Cayley's formula and demonstrates its usefulness in probabilistic analysis of random trees, including new conjectures on tree height distributions.
Findings
A simple bijective proof of Cayley's formula is presented.
The proof is applied to derive probabilistic identities and bounds for random trees.
A new partial order on degree sequences is proposed, with conjectures on its stochastic implications.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Advanced Graph Theory Research · Theoretical and Computational Physics
