Related papers: Flow-Cut Dualities for Sheaves on Graphs

The NP-hard problem of correlation clustering is to partition a signed graph such that the number of conflicts between the partition and the signature of the graph is minimized. This paper studies graph signatures that allow the optimal…

Given a graph with non-negative edge weights, there are various ways to interpret the edge weights and induce a metric on the vertices of the graph. A few examples are shortest-path, when interpreting the weights as lengths; resistance…

In~\cite{rotvandervorst} a homology theory --Morse-Conley-Floer homology-- for isolated invariant sets of arbitrary flows on finite dimensional manifolds is developed. In this paper we investigate functoriality and duality of this homology…

We consider the problem of multicommodity flows in planar graphs. Okamura and Seymour showed that if all the demands are incident on one face, then the cut-condition is sufficient for routing demands. We consider the following…

Relations between multiple unitarity cuts and coproducts of Feynman integrals are extended to allow for internal masses. These masses introduce new branch cuts, whose discontinuities can be derived by placing single propagators on shell and…

Local clustering aims to identify a cluster within a given graph that includes a designated seed node or a significant portion of a group of seed nodes. This cluster should be well-characterized, i.e., it has a high number of internal edges…

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…

Let $G=(V,E)$ be a graph with four distinguished vertices, two sources $s_1, s_2$ and two sinks $t_1,t_2$, let $c:\, E \rightarrow \mathbb Z_+$ be a capacity function, and let ${\cal P}$ be the set of all simple paths in $G$ from $s_1$ to…

There is an interplay between models, specified by variables and equations, and their connections to one another. This dichotomy should be reflected in the abstract as well. Without referring to the models directly -- only that a model…

A semiring scheme generalizes a scheme in such a way that the underlying algebra is that of semirings. We generalize \v{C}ech cohomology theory and invertible sheaves to semiring schemes. In particular, when $X=\mathbb{P}^n_M$, a projective…

We consider a filtration on the cohomology of the structure sheaf indexed by (not necessarily reduced) divisors ``at infinity''. We show that the filtered pieces have transfers morphisms, fpqc descent, and are so called cube invariant. In…

We introduce semiframes (an algebraic structure) and investigate their duality with semitopologies (a topological one). Both semitopologies and semiframes are relatively recent developments, arising from a novel application of topological…

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

We show the existence of length-constrained expander decomposition in directed graphs and undirected vertex-capacitated graphs. Previously, its existence was shown only in undirected edge-capacitated graphs [Haeupler-R\"acke-Ghaffari, STOC…

In arXiv:1906.11820 and arXiv:1907.05404 we proposed an approach based on graphs to characterize 5d superconformal field theories (SCFTs), which arise as compactifications of 6d $\mathcal{N}= (1,0)$ SCFTs. The graphs, so-called combined…

Most state-of-the-art motion segmentation algorithms draw their potential from modeling motion differences of local entities such as point trajectories in terms of pairwise potentials in graphical models. Inference in instances of minimum…

Let $(M, \mathcal{F})$ be a compact Riemannian foliated manifold. We consider a family of compatible Feller semigroups in $C(M^n)$ associated to laws of the $n$-point motion. Under some assumptions (Le Jan and Raimond, \cite{Le…

A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast traffic (multiple sources communicating independent messages to multiple destinations): the min cut upper bound is within a…

We consider algorithms and spectral bounds for sparsest cut and conductance in directed polymatrodal networks. This is motivated by recent work on submodular hypergraphs \cite{Yoshida19,LiM18,ChenOT23,Veldt23} and previous work on…