Related papers: Crossing versus locking: Bit threads and continuum…
A link stream is a collection of triplets $(t,u,v)$ indicating that an interaction occurred between $u$ and $v$ at time $t$. Link streams model many real-world situations like email exchanges between individuals, connections between…
Quantum entanglement in 3 spatial dimensions is studied in systems with physical boundaries when an entangling surface intersects the boundary. We show that there are universal logarithmic boundary terms in the entanglement R\'{e}nyi…
It is increasingly common to model, simulate, and process complex materials based on loopy structures, such as in yarn-level cloth garments, which possess topological constraints between inter-looping curves. While the input model may…
We derive several new quantum bit thread prescriptions for holographic entanglement entropy, equivalent for static states to the quantum extremal surface formula. Our new prescriptions come in many varieties: vector field-based or based on…
This paper provides a new duality between entropy functions and network codes. Given a function $g\geq 0$ defined on all proper subsets of $N$ random variables, we provide a construction for a network multicast problem which is solvable if…
A given fractional quantum Hall state may admit multiple, distinct edge phases on its boundary. We explore the implications that multiple edge phases have for the entanglement spectrum and entropy of a given bulk state. We describe the…
For a static time slice of AdS$_3$ we describe a particular class of minimal surfaces which form trivalent networks of geodesics. Through geometric arguments we provide evidence that these surfaces describe a measure of multipartite…
A multiflow in a planar graph is uncrossed if its support paths do not cross. Recently such flows have played a role in approximation algorithms for maximum disjoint paths in "fully-planar" instances, where the combined supply-demand graph…
In this paper we explore how non trivial boundary conditions could influence the entanglement entropy in a topological order in 2+1 dimensions. Specifically we consider the special class of topological orders describable by the quantum…
Tensor networks provide a natural framework for exploring holographic duality because they obey entanglement area laws. They have been used to construct explicit toy models realizing many interesting structural features of the AdS/CFT…
Motivated by the approach of random linear codes, a new distance in the vector space over a finite field is defined as the logarithm of the "surface area" of a Hamming ball with radius being the corresponding Hamming distance. It is named…
We compute the entropy of a closed bounded region of space for pure 3d Riemannian gravity formulated as a topological BF theory for the gauge group SU(2) and show its holographic behavior. More precisely, we consider a fixed graph embedded…
Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the…
Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that…
The decode-forward achievable region is studied for general networks. The region is subject to a fundamental tension in which nodes individually benefit at the expense of others. The complexity of the region depends on all the ways of…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of the program. The problem is important for static analysis and is used…
We elaborate on the method introduced in arXiv:2403.02165 for holographic duals of Boundary Conformal Field Theories (BCFTs) with multiple boundaries. Using these advances we calculate the entanglement entropy as a function of time for…
The formation of triangles in complex networks is an important network property that has received tremendous attention. The formation of triangles is often studied through the clustering coefficient. The closure coefficient or transitivity…
For quantum gravity states associated to open spin network graphs, we study how the entanglement entropy of the boundary degrees of freedom (spins on open edges) is affected by the bulk data, specifically by its combinatorial structure and…