Pith. sign in

The Junction Law for Multipartite Entanglement in Confining Holographic Backgrounds

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
abstract

We investigate how the junction law for multipartite entanglement is realized in confining holographic backgrounds, using genuine multi-entropy (GM) as our main diagnostic. We first study an AdS$_3$ hard-wall toy model as an analytic benchmark, where multi-way cuts and junction geometries can be analyzed explicitly. In this setup, we classify the relevant saddles, determine the dominant phases, and show that the genuinely multipartite contribution diagnosed by GM is localized near the junction. We also examine how this structure depends on subsystem sizes, asymmetry, and the confinement scale, including phase transitions between competing saddles. We then move beyond the hard-wall benchmark to smooth confining geometries, focusing on the D4-soliton and D3-soliton backgrounds and formulating the corresponding framework also for the Klebanov--Strassler background. In the smooth-cap examples, we find that the junction picture persists, while the detailed phase structure differs from the hard-wall case: in particular, the hard-wall plateau does not survive, and GM instead decreases monotonically and vanishes at a finite critical scale. We also find that the short-distance behavior is background-dependent, with $\mathrm{GM}^{(3)}\sim L^{-4}$ in the D4-soliton background, $\mathrm{GM}^{(3)}\sim L^{-2}$ in the D3-soliton background, and $\mathrm{GM}^{(3)}\sim L^{-2}\cdot (\log L)^{2}$ in the Klebanov--Strassler background. These results clarify which features of the junction-law picture are robust in confining holography and which features of the phase structure and short-distance scaling are background-dependent.

fields

hep-th 2

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Multi-entropy in random tensor networks

hep-th · 2026-06-03 · unverdicted · novelty 7.0

For n=2, Rényi multi-entropies in RTNs are determined by minimal multiway cuts; the minimal multiway cut conjecture fails for integer n>2 with explicit counterexamples.

citing papers explorer

Showing 2 of 2 citing papers.