Observables of random spanning trees in random environment
Luca Makowiec

TL;DR
This thesis investigates the properties of random spanning trees in random environments across various graphs, analyzing observables as functions of disorder strength and comparing them to classical spanning tree models.
Contribution
It introduces the study of RSTRE across different graph families, providing new insights into diameter and local observables, including novel results on Euclidean lattices and supercritical random graphs.
Findings
Diameter results align with previous studies
New insights into local observables
Diameter of unweighted UST on supercritical graphs
Abstract
In this thesis, we study a new disordered system called random spanning tree in random environment (RSTRE) across different families of graphs with varying disorder distributions. We examine several observables as functions of the disorder strength (inverse temperature) , and compare their values to the extreme cases and , which correspond to the uniform spanning tree (UST) and the minimum spanning tree (MST), respectively. The results concerning the diameter are in line with those of arXiv:2311.01808 and arXiv:2410.16830, while the findings on local observables are based on arXiv:2410.16836. This thesis also includes new material on the RSTRE in the Euclidean infinite lattice, as well as a novel result on the diameter of the unweighted UST on a slightly supercritical random graph.
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 · Theoretical and Computational Physics · Complex Network Analysis Techniques
