On the construction of graph models realizing given entropy vectors
Abstract
A bstract We present an efficient algorithm for the construction of a holographic simple tree graph model that realizes a given entropy vector, subject to a specific “chordality” condition first introduced in arXiv:2412.18018. We further develop the toolkit of the correlation hypergraph, particularly in relation to coarse-graining and fine-graining of subsystems. We then use these techniques to take the first steps towards the generalization of this new algorithm to arbitrary (not necessarily simple) holographic tree graph models, and the “detection” of unrealizability of an entropy vector independently from the knowledge of holographic entropy inequalities.
Fields of Study & Subjects
Topological and Geometric Data Analysis
Advanced Graph Theory Research
Theoretical and Computational Physics
Publication details
- Journal / source
- Journal of High Energy Physics
- Publisher
- Springer Science and Business Media LLC
- Volume
- 2026
- Issue
- 5
- Publication date
- 6 May 2026
- Language
- EN