Related papers: Finding flows in the one-way measurement model
A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…
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…
Assuming a-priori a smooth generating vector field, we introduce a generally covariant measure of the flow geometry called the referential gradient of the flow. The main result is the explicit relation between the referential gradient and…
We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to simple data structures, achieving an O(n log n) running time…
Networks represent how the entities of a system are connected and can be partitioned differently, prompting ways to compare partitions. Common approaches for comparing network partitions include information-theoretic measures based on…
A flow invariant is a quantity depending only on the UV and IR conformal fixed points and not on the flow connecting them. Typically, its value is related to the central charges a and c. In classically-conformal field theories, scale…
In this work, we introduce a new way to quantify information flow in quantum systems, especially for parameterized quantum circuits. We use a graph representation of the circuits and propose a new distance metric using the mutual…
Existence and uniqueness of global in time measure solution for the multidimensional aggregation equation is analyzed. Such a system can be written as a continuity equation with a velocity field computed through a self-consistent…
An algorithm is proposed for generalized mean curvature flow of closed two-dimensional surfaces, which include inverse mean curvature flow, powers of mean and inverse mean curvature flow, etc. Error estimates are proven for semi- and full…
For quantum computing (QC) to emerge as a practically indispensable computational tool, there is a need for quantum protocols with an end-to-end practical applications -- in this instance, fluid dynamics. We debut here a high performance…
This paper aims at building a unified framework to deal with a wide class of local and nonlocal translation-invariant geometric flows. First, we introduce a class of generalized curvatures, and prove the existence and uniqueness for the…
This paper introduces Gauge Flow Models, a novel class of Generative Flow Models. These models incorporate a learnable Gauge Field within the Flow Ordinary Differential Equation (ODE). A comprehensive mathematical framework for these…
The spectra of parallel flows (that is, flows governed by first-order differential operators parallel to one direction) are investigated, on both $L^2$ spaces and weighted-$L^2$ spaces. As a consequence, an example of a flow admitting a…
Sampling a probability distribution with an unknown normalization constant is a fundamental problem in computational science and engineering. This task may be cast as an optimization problem over all probability measures, and an initial…
In this study, we utilized the quantum flow (QFlow) method to perform quantum simulations of correlated systems. The QFlow approach allows for sampling large sub-spaces of the Hilbert space by solving coupled variational problems in reduced…
In 1961, Gomory and Hu showed that the All-Pairs Max-Flow problem of computing the max-flow between all $n\choose 2$ pairs of vertices in an undirected graph can be solved using only $n-1$ calls to any (single-pair) max-flow algorithm. Even…
Given a countable group $G$, we say that a metrizable flow $Y$ is model-universal if by considering the various invariant measures on $Y$, we can recover every free measure-preserving $G$-system up to isomorphism. Weiss has constructed a…
The Willmore flow is well known problem from the differential geometry. It minimizes the Willmore functional defined as integral of the mean-curvature square over given manifold. For the graph formulation, we derive modification of the…
We consider the number of paths that must pass through a subset $X$ of vertices of a network $N$ in a maximum sequence of arc-disjoint paths connecting two vertices $y$ and $z$. We show that when $X$ is a singleton, that number equals the…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…