Related papers: Non-Abelian Flows in Networks
A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…
In this paper, we introduce a new approach for drawing diagrams that have applications in software visualization. Our approach is to use a technique we call confluent drawing for visualizing non-planar diagrams in a planar way. This…
We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic behavior of a class of measurement patterns defined over them. Dependent Pauli corrections are derived for all…
The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…
In view of the huge success of convolution neural networks (CNN) for image classification and object recognition, there have been attempts to generalize the method to general graph-structured data. One major direction is based on spectral…
It is well known that each nonnegative integral flow on a graph can be decomposed into a sum of nonnegative graphic circuit flows, which cannot be further decomposed into nonnegative integral sub-flows. This is equivalent to saying that the…
In many ways, graphs are the main modality of data we receive from nature. This is due to the fact that most of the patterns we see, both in natural and artificial systems, are elegantly representable using the language of graph structures.…
To describe the flow of a miscible quantity on a network, we introduce the graph wave equation where the standard continuous Laplacian is replaced by the graph Laplacian. This is a natural description of an array of inductances and…
The sorting number of a graph with $n$ vertices is the minimum depth of a sorting network with $n$ inputs and outputs that uses only the edges of the graph to perform comparisons. Many known results on sorting networks can be stated in…
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the arcs. If the source and the sink are on the same face, then…
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total…
In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…
Graph representations offer powerful and intuitive ways to describe data in a multitude of application domains. Here, we consider stochastic processes generating graphs and propose a methodology for detecting changes in stationarity of such…
We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations.…
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…
Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example,…
We consider the evolution of hypersurfaces in $\mathbb{R}^{n+1}$ with normal velocity given by a positive power of the mean curvature. The hypersurfaces under consideration are assumed to be strictly mean convex (positive mean curvature),…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…
Normalizing flows provide a general mechanism for defining expressive probability distributions, only requiring the specification of a (usually simple) base distribution and a series of bijective transformations. There has been much recent…
We derive pointwise curvature estimates for graphical mean curvature flows in higher codimensions. To the best of our knowledge, this is the first such estimates without assuming smallness of first derivatives of the defining map. An…