arXiv · 2512.18702
On the construction of graph models realizing given entropy vectors
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Veronika E. Hubeny, Massimiliano Rota. 2025-12-21. On the construction of graph models realizing given entropy vectors. https://arxiv.org/abs/2512.18702
Cite the original work for its findings. Save a collection to share your selection of sources.