Related papers: Flow-Cut Dualities for Sheaves on Graphs
Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…
Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general…
In the minimum Multicut problem, the input is an edge-weighted supply graph $G=(V,E)$ and a simple demand graph $H=(V,F)$. Either $G$ and $H$ are directed (DMulC) or both are undirected (UMulC). The goal is to remove a minimum weight set of…
We expand the toolbox of (co)homological methods in computational topology by applying the concept of persistence to sheaf cohomology. Since sheaves (of modules) combine topological information with algebraic information, they allow for…
We study transport processes on infinite metric graphs with non-constant velocities and matrix boundary conditions in the $\\mathrm{L}^{\infty}$-setting. We apply the theory of bi-continuous operator semigroups to obtain well-posedness of…
Important problems across multiple disciplines involve computations on the semiring $(\times, \max)$ (or its equivalents, the negated version $(\times, \min)$), the log-transformed version $(+, \max)$, or the negated log-transformed version…
We study sheaves in the context of a duality theory for lattice structure endowed with extra operations, and in the context of forcing in a topos. Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem…
Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on "Min-Cut"-style criteria, compress both the vertices and edges of the…
Significant progress has been made in our understanding of the analytic structure of FRW wavefunction coefficients, facilitated by the development of efficient algorithms to derive the differential equations they satisfy. Moreover, recent…
A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…
We develop a discrete gauge-theoretic framework for superposition in large language models (LLMs) that replaces the single-global-dictionary premise with a sheaf-theoretic atlas of local semantic charts. Contexts are clustered into a…
We consider the optimal transmission of distributed correlated discrete memoryless sources across a network with capacity constraints. We present several previously undiscussed structural properties of the set of feasible rates and…
An old idea in optimization theory says that since the gradient is a dual vector it may not be subtracted from the weights without first being mapped to the primal space where the weights reside. We take this idea seriously in this paper…
In this paper we show that the six functor formalism for sheaves on locally compact Hausdorff topological spaces, as developed for example in Kashiwara and Schapira's book Sheaves on Manifolds, can be extended to sheaves with values in any…
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…
Motivated by applications to holography and Teichm\"uller theory, we prove a continuous analogue of the max flow/min cut theorem which also takes the topology of the domain into account.
In this paper we address a topological approach to multiflow (multicommodity flow) problems in directed networks. Given a terminal weight $\mu$, we define a metrized polyhedral complex, called the directed tight span $T_{\mu}$, and prove…
This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and…
We introduce a notion of a sheaf of vector spaces on a graph, and develop the foundations of homology theories for such sheaves. One sheaf invariant, its "maximum excess," has a number of remarkable properties. It has a simple definition,…
Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice. Furthermore, the study of \emph{fairness} in Algorithmic Design and Machine Learning has recently received…