Related papers: Beyond the Holographic Entropy Cone via Cycle Flow…
Any traversally generic vector flow on a compact manifold $X$ with boundary leaves some residual structure on its boundary $\d X$. A part of this structure is the flow-generated causality map $C_v$, which takes a region of $\d X$ to the…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
The aim of the present letter is to find the holographic entanglement entropy (HEE) in 2D holographic superconductors (HSC). Indeed, it is possible to compute the exact form of this entropy due to an advantage of approximate solutions…
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…
A novel principle is presented which allows for the proof of bounded weak solutions to a class of physically relevant, strongly coupled parabolic systems exhibiting a formal gradient-flow structure. The main feature of these systems is that…
First principle network models are crucial to make sense of the intricate topology of real complex networks. While modeling efforts have been quite successful in undirected networks, generative models for networks with asymmetric…
We continue the study of the quantum marginal independence problem, namely the question of which faces of the subadditivity cone are achievable by quantum states. We introduce a new representation of the patterns of marginal independence…
We present a graph-based numerical method for solving hyperbolic systems of conservation laws using discontinuous finite elements. This work fills important gaps in the theory as well as practice of graph-based schemes. In particular, four…
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…
The main results of this paper are limit theorems for horocycle flows on compact surfaces of constant negative curvature. One of the main objects of the paper is a special family of horocycle-invariant finitely-additive Hoelder measures on…
Every graph with maximum degree $\Delta$ can be colored with $(\Delta+1)$ colors using a simple greedy algorithm. Remarkably, recent work has shown that one can find such a coloring even in the semi-streaming model. But, in reality, one…
We introduce a description of a minimal surface in a space with boundary, as the world-hypersurface that the entangling surface traces. It does so by evolving from the boundary to the interior of the bulk under an appropriate geometric…
We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…
When the underlying physical network layer in optimal network flow problems is a large graph, the associated optimization problem has a large set of decision variables. In this paper, we discuss how the cycle basis from graph theory can be…
Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds.…
We give a scheme to geometrize the partial entanglement entropy (PEE) for holographic CFT in the context of AdS/CFT. More explicitly, given a point $\textbf{x}$ we geometrize the two-point PEEs between $\textbf{x}$ and any other points in…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{4/3+o(1)}U^{1/3}$ time. This improves upon the…
The monography presents a new algorithm for finding the clique of maximal length in a nonseparable graph. The algorithm is based on the properties of the representation of a clique as a subset of the set of cycles with a length of three,…
We prove that sufficiently low-entropy closed hypersurfaces can be perturbed so that their mean curvature flow encounters only spherical and cylindrical singularities. Our theorem applies to all closed surfaces in $\mathbb{R}^3$ with…
Graph Ricci curvature is crucial as it geometrically quantifies network structure. It pinpoints bottlenecks via negative curvature, identifies cohesive communities with positive curvature, and highlights robust hubs. This guides network…