Related papers: Crossing versus locking: Bit threads and continuum…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
Bounds on information combining are entropic inequalities that determine how the information, or entropy, of a set of random variables can change when they are combined in certain prescribed ways. Such bounds play an important role in…
Using recent developments in expressing one-loop partition functions in Euclidean $AdS_2$ space-times in terms of character integrals, we relate the one-loop effective action for a free field theory in $AdS_2$ (comprised of a massless…
A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.
To better understand the overlapping modular organization of large networks with respect to flow, here we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between…
We investigate the two unicast flow problem over layered linear deterministic networks with arbitrary number of nodes. When the minimum cut value between each source-destination pair is constrained to be 1, it is obvious that the triangular…
Current theories on the conformation and dynamics of unknotted and non-concatenated ring polymers in melt conditions describe each ring as a tree-like double-folded object. While evidence from simulations supports this picture on a single…
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 investigate the entanglement entropy in gravity duals of confining large $N_c$ gauge theories using the proposal of arXiv:hep-th/0603001, arXiv:hep-th/0605073. Dividing one of the directions of space into a line segment of length $l$ and…
Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering…
A cross-diffusion system modeling the information herding of individuals is analyzed in a bounded domain with no-flux boundary conditions. The variables are the species' density and an influence function which modifies the information state…
We investigate the binary-symmetric parallel-relay network where there is one source, one destination, and multiple relays in parallel. We show that forwarding relays, where the relays merely transmit their received signals, achieve the…
We introduce a new technique to certify lower bounds on the multicut size using network coding. In directed networks the network coding rate is not a lower bound on the multicut, but we identify a class of networks on which the rate is…
Entanglement is one of the most intriguing features of quantum theory and a main resource in quantum information science. Ground states of quantum many-body systems with local interactions typically obey an "area law" meaning the…
This paper considers $n$-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by $\log_2 n$. This…
Network coding is a technique to maximize communication rates within a network, in communication protocols for simultaneous multi-party transmission of information. Linear network codes are examples of such protocols in which the local…
We present a methodology for simulating three-dimensional flow of incompressible viscoplastic fluids modelled by generalised Newtonian rheological equations. It is implemented in a highly efficient framework for massively parallelisable…
The tilings of lozenges in 2 dimensions and of rhomboedra in 3 dimensions are studied when they are constrained by fixed boundary conditions. We establish a link between those conditions and free or periodic boundary ones: the entropy is…
The Ryu-Takayanagi conjecture provides a holographic description for the entanglement entropy for the strongly coupled holographic CFTs in the semi-classical limit. It proposes that the entanglement entropy is given by the area of the…
In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key instrument for modeling large-scale complex systems, due to…