Related papers: Flow Rounding
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed over time by choosing a sequence of capacity labelings from…
A multiflow in a planar graph is uncrossed if its support paths do not cross. Recently such flows have played a role in approximation algorithms for maximum disjoint paths in "fully-planar" instances, where the combined supply-demand graph…
For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing solutions rely on very restricted classes of…
Normalizing flows are constructed from a base distribution with a known density and a diffeomorphism with a tractable Jacobian. The base density of a normalizing flow can be parameterised by a different normalizing flow, thus allowing maps…
Pinched flow fractionation is shown to be an efficient and selective way to quickly separate particles by size in a very polydisperse semi-concentrated suspension. In an effort to optimize the method, we discuss the quantitative influence…
Computation of the probability that a random graph is connected is a challenging problem, so it is natural to turn to approximations such as Monte Carlo methods. We describe sequential importance resampling and splitting algorithms for the…
The optical flow of natural scenes is a combination of the motion of the observer and the independent motion of objects. Existing algorithms typically focus on either recovering motion and structure under the assumption of a purely static…
Total variation gradient flows are important in several applied fields, including image analysis and materials science. In this paper, we review a few basic topics including definition of a solution, explicit examples and the notion of…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
Bayesian posterior inference is prevalent in various machine learning problems. Variational inference provides one way to approximate the posterior distribution, however its expressive power is limited and so is the accuracy of resulting…
Power flow refers to the injection of power on the lines of an electrical grid, so that all the injections at the nodes form a consistent flow within the network. Optimality, in this setting, is usually intended as the minimization of the…
We present a new simple method for rounding a semidefinite programming relaxation of a constraint satisfaction problem. We apply it to the problem of approximate angular synchronization. Specifically, we are given directed distances on a…
Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…
This work presents mixed variational flows (MixFlows), a new variational family that consists of a mixture of repeated applications of a map to an initial reference distribution. First, we provide efficient algorithms for i.i.d. sampling,…
We use simple equations in order to compare the basins of attraction on the complex plane, corresponding to a large collection of numerical methods, of several order. Two cases are considered, regarding the total number of the roots, which…
In this paper we examine the flow generated by coupled surface and internal small-amplitude water waves in a two-fluid layer model, where we take the upper layer to be rotational (constant vorticity) and the lower layer to be irrotational.…
Generalizing a construction of A. Weil, we introduce a topological invariant for flows on compact, connected, finite dimensional, abelian, topological groups. We calculate this invariant for some examples and compare the invariant with…
Under general assumptions on the velocity field, it is possible to construct a flow that is forward untangled. Once such a flow has been selected, the associated transport problem is well-posed.
The recent introduction of machine learning techniques, especially normalizing flows, for the sampling of lattice gauge theories has shed some hope on improving the sampling efficiency of the traditional HMC algorithm. Naive use of…
In this note, we revisit the rounding algorithm of Wajc. Wajc gave a fully-adaptive randomized algorithm that rounds a dynamic fractional matching in an unweighted bipartite graph to an integral matching of nearly the same value in…