相关论文: Flow-Cut Dualities for Sheaves on Graphs

We develop the theory of transformation semigroups that have degree 2, that is, act by partial functions on a finite set such that the inverse image of points have at most two elements. We show that the graph of fibers of such an action…

Deep learning methods for graphs have seen rapid progress in recent years with much focus awarded to generalising Convolutional Neural Networks (CNN) to graph data. CNNs are typically realised by alternating convolutional and pooling layers…

Motivated by recent experimental advances (Stroock et al. 2002) in microfluidic mixers, we study the passive mixing and flow properties of a patterned microchannel by means of computational fluid dynamics (CFD). Such geometries overcome the…

The problem of sending the maximum amount of flow $q$ between two arbitrary nodes $s$ and $t$ of complex networks along links with unit capacity is studied, which is equivalent to determining the number of link-disjoint paths between $s$…

A functorial semi-norm on singular homology is a collection of semi-norms on the singular homology groups of spaces such that continuous maps between spaces induce norm-decreasing maps in homology. Functorial semi-norms can be used to give…

Cellular sheaves equip graphs with a "geometrical" structure by assigning vector spaces and linear maps to nodes and edges. Graph Neural Networks (GNNs) implicitly assume a graph with a trivial underlying sheaf. This choice is reflected in…

We construct a diagrammatic coaction acting on one-loop Feynman graphs and their cuts. The graphs are naturally identified with the corresponding (cut) Feynman integrals in dimensional regularization, whose coefficients of the Laurent…

Both the combinatorial and the circuit diameters of polyhedra are of interest to the theory of linear programming for their intimate connection to a best-case performance of linear programming algorithms. We study the diameters of dual…

Let M be the moduli scheme of canonically polarized manifolds with Hilbert polynomial h. We construct for a given finite set I of natural numbers m>1 with h(m)>0 a projective compactification M' of the reduced scheme underlying M such that…

We develop the geometric and homological framework for non-commutative $n$-ary $\Gamma$-semirings by constructing a sheaf and derived theory over their non-commutative $\Gamma$-spectrum. Starting with a non-commutative $n$-ary…

We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment…

It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…

Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem of of distributive bounded lattices expanded by modalities (functions distributing over joins) as the continuous sections of sheaves. Our…

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…

We introduce a sheaf-theoretic characterization of task solvability in general distributed computing models, unifying distinct approaches to message-passing models. We establish cellular sheaves as a natural mathematical framework for…

We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and…

Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…

In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…

The maximum independent sets in the Doob graphs D(m,n) are analogs of the distance-2 MDS codes in Hamming graphs and of the latin hypercubes. We prove the characterization of these sets stating that every such set is semilinear or…

Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to a group of vertices in a weighted graph, and then study the…