Related papers: Balanced flows for transshipment problems
We solve the following problem: Can an undirected weighted graph G be parti- tioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible…
In this work we investigate the existence of weak solutions for steady flows of generalized incompressible and homogeneous viscous fluids. The problem is modeled by the steady case of the generalized Navier-Stokes equations, where the…
This article provides a reduced-order modelling framework for turbulent compressible flows discretized by the use of finite volume approaches. The basic idea behind this work is the construction of a reduced-order model capable of providing…
This paper investigates the connections between rectified flows, flow matching, and optimal transport. Flow matching is a recent approach to learning generative models by estimating velocity fields that guide transformations from a source…
We study the finite element formulation of general boundary conditions for incompressible flow problems. Distinguishing between the contributions from the inviscid and viscid parts of the equations, we use Nitsche's method to develop a…
In this paper, we consider a modified projected Gauss-Newton method for solving constrained nonlinear least-squares problems. We assume that the functional constraints are smooth and the the other constraints are represented by a simple…
A graph (digraph) $G=(V,E)$ with a set $T\subseteq V$ of terminals is called inner Eulerian if each nonterminal node $v$ has even degree (resp. the numbers of edges entering and leaving $v$ are equal). Cherkassky and Lov\'asz showed that…
Given a road network modelled as a planar straight-line graph $G=(V,E)$ with $|V|=n$, let $(u,v)\in V\times V$, the shortest path (distance) between $u,v$ is denoted as $\delta_G(u,v)$. Let $\delta(G)=\max_{(u,v)}\delta_G(u,v)$, for…
The following problem, which stems from the ``flux phase'' problem in condensed matter physics, is analyzed and extended here: One is given a planar graph (or lattice) with prescribed vertices, edges and a weight $\vert t_{xy}\vert$ on each…
An edge-weighted graph $G=(V,E)$ is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory problems, such as…
The classical theorems of inviscid stability have been extended for compressible flows past compliant surfaces. We consider normal modes imposed on a plane parallel compressible flow past compliant walls modelled as spring-backed plates and…
Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed by V, we say that omega is a gamma-L-flow if for each v in V,…
We study the propagation of monochromatic surface waves on a turbulent flow. The flow is generated in a layer of liquid metal by an electromagnetic forcing. This forcing creates a quasi two-dimensional (2D) turbulence with strong vertical…
The vortex-wave system is a model for the evolution of 2D incompressible fluids in which the vorticity is split into a finite sum of Dirac masses plus an Lp part. Existence of a weak solution for this system was recently proved by Lopes…
We study a nonlinear fluid-structure interaction problem in which the fluid is described by the three-dimensional incompressible Navier-Stokes equations, and the elastic structure is modeled by the nonlinear plate equation which includes a…
Maintaining a sustainable socio-ecological state of a river delta requires delivery of material and energy fluxes to its body and coastal zone in a way that avoids malnourishment that would compromise system integrity. We present a…
Normalizing Flows are generative models that directly maximize the likelihood. Previously, the design of normalizing flows was largely constrained by the need for analytical invertibility. We overcome this constraint by a training procedure…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…
The steady streaming flow pattern caused by a no-slip sphere oscillating in an unbounded viscous incompressible fluid is calculated exactly to second order in the amplitude. The pattern depends on a dimensionless scale number, determined by…
Given a capacitated graph $G = (V,E)$ and a set of terminals $K \subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low…