Configurational entropy of random trees
We present a graph theoretical approach to the configurational statistics of random treelike objects, such as randomly branching polymers. In particular, for ideal trees we show that Prüfer labeling 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.
Authors
- Angelo Rosa (ORCID: https://orcid.org/0000-0002-9627-2486)
- Ralf Everaers (ORCID: https://orcid.org/0000-0002-6843-2753)
- Pieter H. W. van der Hoek (ORCID: https://orcid.org/0009-0001-1527-3840)
Institutions
- École Normale Supérieure de Lyon (FR)
- Centre National de la Recherche Scientifique (FR)
- Lakshmibai National Institute of Physical Education (IN)
- Scuola Internazionale Superiore di Studi Avanzati (IT)
- Laboratoire de Physique de l'ENS de Lyon (FR)
Publication Details
- Journal
- Physical review. E
- Published
- 2025-11-11
- DOI
- https://doi.org/10.1103/qmv9-1czv
- Citations
- 1
- Primary Topic
- Topological and Geometric Data Analysis
- Type
- article
- Field-Weighted Citation Impact
- 1.50