Configurational entropy of random trees.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 41560194.
- Also identified by DOI 10.1103/qmv9-1czv.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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.