arXiv · 2504.13364
The configurational entropy of random trees
Abstract
We present a graph theoretical approach to the configurational statistics of random tree-like objects, such as randomly branching polymers. In particular, for ideal trees we show that Pr\"ufer labelling provides: (i) direct access to the exact configurational entropy as a function of the tree composition, (ii) computable exact expressions for partition functions and important experimental observables for tree ensembles with controlled branching activity and (iii) an efficient sampling scheme for corresponding tree configurations and arbitrary static properties.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Pieter H. W. van der Hoek, Angelo Rosa, Ralf Everaers. 2025-04-17. The configurational entropy of random trees. https://doi.org/10.1103/qmv9-1czv
Cite the original work for its findings. Save a collection to share your selection of sources.