English
Related papers

Related papers: Balanced flows for transshipment problems

200 papers

We study the modeling of a compressible two-phase flow in a porous medium. The governing free boundary problem is known as the Verigin problem with phase transition. We introduce a novel variational framework to construct weak solutions.…

Analysis of PDEs · Mathematics 2026-01-29 Anna Kubin , Tim Laux , Alice Marveggio

Structural balance theory studies stability in networks. Given a $n$-vertex complete graph $G=(V,E)$ whose edges are labeled positive or negative, the graph is considered \emph{balanced} if every triangle either consists of three positive…

Data Structures and Algorithms · Computer Science 2023-06-02 Vikrant Ashvinkumar , Sepehr Assadi , Chengyuan Deng , Jie Gao , Chen Wang

This paper is concerned with a mathematical model which describes 2-D flows of an incompressible viscoelastic fluid of Oldroyd type in a bounded domain. We prove the existence and uniqueness theorem for global (in time) weak solutions and…

Analysis of PDEs · Mathematics 2017-08-15 Mikhail A. Artemov , George G. Berdzenishvili

The study of passive scalar transport in a turbulent velocity field leads naturally to the notion of generalized flows which are families of probability distributions on the space of solutions to the associated ODEs, which no longer satisfy…

Chaotic Dynamics · Physics 2009-10-31 Weinan E , Eric Vanden Eijnden

The three-dimensional equations for the compressible flow of liquid crystals are considered. An initial-boundary value problem is studied in a bounded domain with large data. The existence and large-time behavior of a global weak solution…

Analysis of PDEs · Mathematics 2015-05-30 Dehua Wang , Cheng Yu

We present faster algorithms for approximate maximum flow in undirected graphs with good separator structures, such as bounded genus, minor free, and geometric graphs. Given such a graph with $n$ vertices, $m$ edges along with a recursive…

Data Structures and Algorithms · Computer Science 2012-10-19 Gary Miller , Richard Peng

The flow of two macroscopically immiscible, viscous, incompressible fluids with unmatched densities is studied, where a transfer of mass between the constituents by phase transition is taken into account. To this end, two…

Analysis of PDEs · Mathematics 2025-05-09 Helmut Abels , Harald Garcke , Julia Wittmann

We propose a new approach to graph compression by appeal to optimal transport. The transport problem is seeded with prior information about node importance, attributes, and edges in the graph. The transport formulation can be setup for…

Machine Learning · Computer Science 2019-05-30 Vikas K. Garg , Tommi Jaakkola

We have generalized the semi-analytic approach of special flow to the description of flows of passive particles taking into account internal noise. The model is represented by a series of recurrence relations. The recurrence relations are…

Statistical Mechanics · Physics 2023-12-12 Boris S. Maryshev , Lyudmila S. Klimenko

We consider the Cauchy problem for incompressible viscoelastic fluids in the whole space $\mathbb{R}^d$ ($d=2,3$). By introducing a new decomposition via Helmholtz's projections, we first provide an alternative proof on the existence of…

Analysis of PDEs · Mathematics 2023-07-28 Xianpeng Hu , Hao Wu

We consider a control system describing the interaction of water waves with a partially immersed rigid body constraint to move only in the vertical direction. The fluid is modeled by the shallow water equations. The control signal is a…

Analysis of PDEs · Mathematics 2021-08-12 Pei Su , Marius Tucsnak

Rectified flow (Liu et al., 2022; Liu, 2022; Wu et al., 2023) is a method for defining a transport map between two distributions, and enjoys popularity in machine learning, although theoretical results supporting the validity of these…

Statistics Theory · Mathematics 2025-12-11 Gonzalo Mena , Arun Kumar Kuchibhotla , Larry Wasserman

In this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labeling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex,…

Combinatorics · Mathematics 2021-09-15 Daniël M. H. van Gent

We consider a routing problem which plays an important role in several applications, primarily in communication network planning and VLSI layout design. The original underlying graph algorithmic task is called Disjoint Paths problem. In…

Data Structures and Algorithms · Computer Science 2018-09-19 Rupei Xu , András Faragó

We consider general, steady, balanced flows of a commodity over a network where an instance of the network flow is characterized by edge flows and nodal potentials. Edge flows in and out of a node are assumed to be conserved, thus…

Optimization and Control · Mathematics 2015-04-06 Marc Vuffray , Sidhant Misra , Michael Chertkov

We study the weakly non-linear development of shear-driven gravity waves, and investigate the mixing properties of the finite amplitude solutions. Calculations to date have been restricted to the linear theory, which predicts that gravity…

Fluid Dynamics · Physics 2007-05-23 Alexandros Alexakis , Yuan-Nan Young , Robert Rosner

We consider an viscous, incompressible Newtonian fluid flowing through a thin elastic structure. The motion of the structure is described by the equations of a linearised Koiter shell, whose motion is restricted to transverse displacements.…

Analysis of PDEs · Mathematics 2018-07-20 Hannes Eberlein , Michael Ruzicka

The present research is devoted to the problem of stability of the fluid flow moving in a channel with flexible walls and interacting with the walls, which are subject to traveling waves. Experimental data shows that the energy of the…

Fluid Dynamics · Physics 2021-01-01 Marianna A. Shubov , Madeline M. Edwards

The simplest way to make a dynamical system out of a finite connected graph $G$ is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, for each vertex. The phase space $\mathcal{P}(G)$ then…

Combinatorics · Mathematics 2025-08-20 Dustin Connery-Grigg , François Lalonde , Jordan Payette

With the recent proliferation of heterogeneous, GPU-accelerated supercomputers, high-order computational fluid dynamics (CFD) simulations of complex, turbulent flows are more accessible than ever. To leverage the computing power of these…