Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the construction of graph models realizing given entropy vectors

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月6日

查看全文
  • Veronika E. Hubeny,
  • Massimiliano Rota

摘要

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.