Generating uniform spanning trees from conditioned Bienaym´e–Galton–Watson trees

Authors

  • Albert Vives Universitat Politècnica De Catalunya

Keywords:

random trees, Bienaymé–Galton–Watson trees

Abstract

This report explores uniform spanning tree (UST) generation, essential in combinatorics and probability with applications in network theory and physics. Using conditioned Bienaymé–Galton–Watson (BGW) processes, it introduces a method to generate USTs. Rigorous proofs show that conditioning on a fixed number of vertices ensures uniform distribution and let us examine structural properties like height and width.

Downloads

Download data is not yet available.

Downloads

Published

2025-12-04

How to Cite

Vives, A. (2025). Generating uniform spanning trees from conditioned Bienaym´e–Galton–Watson trees. Reports@SCM, 10(1), 1–12. Retrieved from https://revistes.iec.cat/index.php/reports/article/view/155860

Issue

Section

Articles