The configurational entropy of random trees
arXiv:2504.13364 · doi:10.1103/qmv9-1czv
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üfer 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.
16 pages, 6 main figures, 1 suppl. figure, 1 suppl. table
References in corpus (9)
- On the Tree-Like Structure of Rings in Dense Solutions
- DNA supercoiling in bacteria: state of play and challenges from a viewpoint of physics based modeling
- Computer simulations of melts of randomly branching polymers
- Local loop opening in untangled ring polymer melts: A detailed "Feynman test" of models for the large scale structure
- Beyond Flory theory: Distribution functions for interacting lattice trees
- Computer simulations of randomly branching polymers: Annealed vs. quenched branching structures
- Scaling properties of RNA as a randomly branching polymer
- Amoeba Monte Carlo algorithms for random trees with controlled branching activity: efficient trial move generation and universal dynamics
- Entropy of self-avoiding branching polymers: mean field theory and Monte Carlo simulations