Related papers: Crossing versus locking: Bit threads and continuum…
We introduce the concepts of closed sets and closure operators as mathematical tools for the study of social networks. Dynamic networks are represented by transformations. It is shown that under continuous change/transformation, all…
We investigate the bipartite entanglement for the boundary states in a simple type of spin networks with dangling edges, in which the two complementary parts are linked by two or more edges. Firstly, the spin entanglement is considered in…
We prove, for any state in a conformal field theory defined on a set of boundary manifolds with corresponding classical holographic bulk geometry, that for any bipartition of the boundary into two non-clopen sets, the density matrix cannot…
Entanglement is a key quantum phenomena and understanding transitions between phases of matter with different entanglement properties are an interesting probe of quantum mechanics. We numerically study a model of a 2D tensor network…
The continuous min flow-max cut principle is used to reformulate the 'complexity=volume' conjecture using Lorentzian flows -- divergenceless norm-bounded timelike vector fields whose minimum flux through a boundary subregion is equal to the…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
The maximum achievable capacity from source to destination in a network is limited by the min-cut max-flow bound; this serves as a converse limit. In practice, link capacities often fluctuate due to dynamic network conditions. In this work,…
The Ryu-Takayanagi conjecture predicts a holographic dual of the entanglement entropy of a CFT. It proposes that the entanglement entropy is given by the area of the minimal surface in the dual spacetime. In the semi-classical limit, this…
Multilayer networks preserve full information about the different interactions among the constituents of a complex system, and have recently proven quite useful in modelling transportation networks, social circles, and the human brain. A…
We present a constructive algorithm for the determination of Ryu-Takayanagi surfaces in AdS3/CFT2 which exploits previously noted connections between holographic entanglement entropy and max-flow/min-cut. We then characterize its complexity…
The Renyi entropies and entanglement entropy of 1+1 CFTs with gravity duals can be computed by explicit construction of the bulk spacetimes dual to branched covers of the boundary geometry. At the classical level in the bulk this has…
Entanglement entropy for spatial subregions is difficult to define in string theory because of the extended nature of strings. Here we propose a definition for Bosonic open strings using the framework of string field theory. The key…
Finite pieces of locally isostatic networks have a large number of floppy modes because of missing constraints at the surface. Here we show that by imposing suitable boundary conditions at the surface, the network can be rendered…
Usually the boundary of a community in a network is drawn between nodes and thus crosses its outgoing links. If we construct overlapping communities by applying the link-clustering approach nodes and links interchange their roles.…
This dissertation reviews several recent advances at the intersection of quantum information and holography. In holography, properties of quantum systems admit a gravitational interpretation via the AdS/CFT correspondence. For holographic…
In many high-impact applications, it is important to ensure the quality of output of a machine learning algorithm as well as its reliability in comparison with the complexity of the algorithm used. In this paper, we have initiated a…
We postulate the existence of universal crossover functions connecting the universal parts of the entanglement entropy to the low temperature thermal entropy in gapless quantum many-body systems. These scaling functions encode the intuition…
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between…
Microscopic particles flowing through narrow channels may accumulate near bifurcation points provoking flow reduction, clogging and ultimately chip breakage. Here we show that the full flow behavior of colloidal particles through a…
We consider the problem of serving multicast flows in a crossbar switch. We show that linear network coding across packets of a flow can sustain traffic patterns that cannot be served if network coding were not allowed. Thus, network coding…