Related papers: Bit threads on hypergraphs
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
We study two-interval holographic entanglement entropy and entanglement wedge cross section in cutoff AdS. In particular, we investigate phase transitions of them. For two-interval entanglement entropy, the transition point monotonically…
Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the…
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
Entanglement entropy of holographic CFTs is expected to play a crucial role in the reconstruction of semiclassical bulk gravity. We consider the entanglement entropy of spherical regions of vacuum, which is known to contain universal…
We investigate the behavior of entanglement entropy across the holographic p-wave superconductor phase transition in an Einstein-Yang-Mills theory with a negative cosmological constant. The holographic entanglement entropy is calculated for…
A prescription to calculate the minimum number of bits needed for binary strip detector readout is presented. This permits a systematic analysis of the readout efficiency relative to this theoretical minimum number of bits. Different level…
We consider in this paper the problem of computing the entropy of a braid. We recall its definition and construct, for each braid, a sequence of real numbers, whose limit is its entropy. We state one conjecture about the convergence speed,…
In this paper, we study the holographic quantum entanglement structure in the finite-temperature CFT state/planar BTZ black hole correspondence from the perspective of entanglement threads. Unlike previous studies based on bit threads,…
Hypergraphs have emerged as a powerful modeling framework to represent systems with multiway interactions, that is systems where interactions may involve an arbitrary number of agents. Here we explore the properties of real-world…
This is a concise review of holographic superconductors and superfluids. We highlight some predictions of the holographic models and the emphasis is given to physical aspects rather than to the technical details, although some references to…
Estimating the number of subgraphs in data streams is a fundamental problem that has received great attention in the past decade. In this paper, we give improved streaming algorithms for approximately counting the number of occurrences of…
In this paper we review the AdS/BCFT proposal of T. Takayanagi for holographic description of systems with boundaries, in particular, boundary conformal field theories (BCFTs). Motivated by better understanding of the proposed duality we…
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k>2, our algorithms for…
The pseudo entropy is a promising recent generalization of the entanglement entropy to the situations in which both the initial and final state are involved, with the density matrix promoted to the transition matrix. However, in contrast to…
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…
Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and more generally, biomathematics. They are also a source of…
We study holographic entanglement entropy in dS/CFT and introduce time-like entanglement entropy in CFTs. Both of them take complex values in general and are related with each other via an analytical continuation. We argue that they are…
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of this function. We achieve this combinatorial characterization…
The concept of entropy rate for a dynamical process on a graph is introduced. We study diffusion processes where the node degrees are used as a local information by the random walkers. We describe analitically and numerically how the degree…