Related papers: Crossing versus locking: Bit threads and continuum…
The complexity of round robin method of intraprocedural data flow analysis is measured in number of iterations over the control flow graph. Existing complexity bounds realistically explain the complexity of only Bit-vector frameworks which…
The All-Pairs Min-Cut problem (aka All-Pairs Max-Flow) asks to compute a minimum $s$-$t$ cut (or just its value) for all pairs of vertices $s,t$. We study this problem in directed graphs with unit edge/vertex capacities (corresponding to…
Confining an answer to the question whether and how the coherent operation of network elements is determined by the the network structure is the topic of our work. We map the structure of signal flow in directed networks by analysing the…
Consider a receiver in a multi-user network that wishes to decode several messages. Simultaneous joint typicality decoding is one of the most powerful techniques for determining the fundamental limits at which reliable decoding is possible.…
The links of a physical network cannot cross, which often forces the network layout into non-optimal entangled states. Here we define a network fabric as a two-dimensional projection of a network and propose the average crossing number as a…
We introduce a unifying framework for the construction of holographic tensor networks, based on the theory of hyperbolic buildings. The underlying dualities relate a bulk space to a boundary which can be homeomorphic to a sphere, but also…
We explore the fine structure of the holographic entanglement entropy proposal (the Ryu-Takayanagi formula) in AdS$_3$/CFT$_{2}$. With the guidance from the boundary and bulk modular flows we find a natural slicing of the entanglement wedge…
The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$…
It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general…
It has long been conjectured that the entropy of quantum fields across boundaries scales as the boundary area. This conjecture has not been easy to test in spacetime dimensions greater than four because of divergences in the von Neumann…
In some many-body systems, certain ground state entanglement (Renyi) entropies increase even as the correlation length decreases. This entanglement non-monotonicity is a potential indicator of non-classicality. In this work we demonstrate…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
In gauge theories the presence of constraints can obstruct expressing the global Hilbert space as a tensor product of the Hilbert spaces corresponding to degrees of freedom localized in complementary regions. In algebraic terms, this is due…
In some physical implementations of quantum computers, 2-qubit operations can be applied only on certain pairs of qubits. Compilation of a quantum circuit into one compliant to such qubit connectivity constraint results in an increase of…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
There have been several spectral bounds for the percolation transition in networks, using spectrum of matrices associated with the network such as the adjacency matrix and the non-backtracking matrix. However they are far from being tight…
We study various entanglement measures in a one-parameter family of three-dimensional, strongly coupled Yang-Mills-Chern-Simons field theories by means of their dual supergravity descriptions. A generic field theory in this family possesses…
We define a relational notion of a subsystem in theories of matrix quantum mechanics and show how the corresponding entanglement entropy can be given as a minimisation, exhibiting many similarities to the Ryu-Takayanagi formula. Our…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
We study the entanglement contour, a quasi-local measure of entanglement, and propose a generic formula for the contour in 1+1d quantum systems. We use this formalism to investigate the real space entanglement structure of various static…