相关论文: Beyond the Holographic Entropy Cone via Cycle Flow…
Even though little is known about the quantum entropy cone for $N\geq4$ subsystems, holographic techniques allow one to get a handle on the subspace of entropy vectors corresponding to states with gravity duals. For static spacetimes and…
Quantum corrections to holographic entanglement entropy require knowledge of the bulk quantum state. In this paper, we derive a novel dual prescription for the generalized entropy that allows us to interpret the leading quantum corrections…
We generate new mathematical tools with which to quantify the macroscopic topological structure of large directed networks. This is achieved via a statistical mechanical analysis of constrained maximum entropy ensembles of directed random…
Following the success of convolution on non-Euclidean space, the corresponding pooling approaches have also been validated on various tasks regarding graphs. However, because of the fixed compression quota and stepwise pooling design, these…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
In the context of gravitational theories describing renormalization group flows across dimensions via AdS/CFT, we study the role of higher-derivative corrections to Einstein gravity. We use the Null Energy Condition to derive monotonicity…
We consider holographic entanglement entropy in AdS black hole backgrounds by using the limit of large number of dimensions. By dividing the geometry to two patches (with one patch covering the vicinity of the black hole horizon and another…
Denoising-based models, including diffusion and flow matching, have led to substantial advances in graph generation. Despite this progress, such models remain constrained by two fundamental limitations: a computational cost that scales…
In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main…
We address the problem of distributed computation of arbitrary functions of two correlated sources $X_1$ and $X_2$, residing in two distributed source nodes, respectively. We exploit the structure of a computation task by coding source…
The entanglement entropy of various geometries is calculated for the boundary theory dual to a stack of N Dp-branes. The entanglement entropies are readily expressed in terms of the effective coupling at the appropriate energy scales. The…
We evaluate reflected entropy in certain anisotropic boundary theories dual to nonrelativistic geometries using holography. It is proposed that this quantity is proportional to the minimal area of the entanglement wedge cross section. Using…
The thermodynamic definition of entropy can be extended to nonequilibrium systems based on its relation to information. To apply this definition in practice requires access to the physical system's microstates, which may be prohibitively…
In this paper, we introduce topological entropy for dynamical systems generated by a single local homeomorphism (Deaconu-Renault systems). More precisely, we generalize Adler, Konheim, and McAndrew's definition of entropy via covers and…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
We introduce a notion of the \emph{crux} of a graph $G$, measuring the order of a smallest dense subgraph in $G$. This simple-looking notion leads to some generalisations of known results about cycles, offering an interesting paradigm of…
We show that every holographic entropy inequality can be recast in the form: "some entanglement wedges reach deeper in the bulk than some other entanglement wedges." When the inequality is saturated, the two sets of wedges reach equally…
We consider holographic entanglement entropy in higher derivative gravity theories. Recently Lewkowycz and Maldacena arXiv:1304.4926 have provided a method to derive the equations for the entangling surface from first principles. We use…
Hypergraphs effectively model higher-order relationships in natural phenomena, capturing complex interactions beyond pairwise connections. We introduce a novel hypergraph message passing framework inspired by interacting particle systems,…
In holographic theories, the reflected entropy has been shown to be dual to the area of the entanglement wedge cross section. We study the same problem in random tensor networks demonstrating an equivalent duality. For a single random…