Related papers: Low-Step Multi-Commodity Flow Emulators
Consistency-based generative models like Shortcut and MeanFlow achieve impressive results via a target-aware design for solving the Probability Flow ODE (PF-ODE). Typically, such methods introduce a target time $r$ alongside the current…
Modal analysis of fluid flows is essential to understand flow physics and fluid-solid interaction mechanisms, and to implement flow control. Unlike unstable flow, the intrinsic attenuation of subcritical flow has led to failures to…
The performance of flow matching and diffusion models can be greatly improved at inference time using reward alignment algorithms, yet efficiency remains a major limitation. While several algorithms were proposed, we demonstrate that a…
Recently there has been considerable progress on the analysis of stability and performance properties of so-called economic Nonlinear Model Predictive Control (NMPC) schemes; i.e. NMPC schemes employing stage costs that are not directly…
Accurate and efficient prediction of multi-scale flows remains a formidable challenge. Constructing theoretical models and numerical methods often involves the design and optimization of parameters. While gradient descent methods have been…
We describe an approach for modeling fluid concentration profiles in grid-based microfluidic chips for fluid mixing. This approach provides an algorithm that predicts fluid concentrations at the chip outlets. Our algorithm significantly…
We consider the problem of multicommodity flows in planar graphs. Seymour showed that if the union of supply and demand graphs is planar, then the cut condition is sufficient for routing demands. Okamura-Seymour showed that if all demands…
We present mesoscopic simulations of the counterion-induced electroosmotic flow in different electrostatic coupling regimes. Two simulation methods are compared, Dissipative Particle Dynamics (DPD) and coupled Lattice-Boltzmann/Molecular…
We propose \emph{Euler Mean Flows (EMF)}, a flow-based generative framework for one-step and few-step generation that enforces long-range trajectory consistency with minimal sampling cost. The key idea of EMF is to replace the trajectory…
Chemical potential of species in solution is essential for understanding various chemical processes at interfaces. Molecular dynamics (MD) simulations, constrained by fixed compositions, cannot satisfy a constant chemical potential…
A new flow solver scalable on multiple Graphics Processing Units (GPUs) for direct numerical simulation of wall-bounded incompressible flow is presented. This solver utilizes a previously reported work (J. Comp. Physics, vol. 352 (2018),…
We propose a novel framework for simulating ink as a particle-laden flow using particle flow maps. Our method addresses the limitations of existing flow-map techniques, which struggle with dissipative forces like viscosity and drag, thereby…
Network flow is one of the most studied combinatorial optimization problems having innumerable applications. Any flow on a directed acyclic graph $G$ having $n$ vertices and $m$ edges can be decomposed into a set of $O(m)$ paths. In some…
Maintaining a $k$-core decomposition quickly in a dynamic graph has important applications in network analysis. The main challenge for designing efficient exact algorithms is that a single update to the graph can cause significant global…
Quantum computational fluid dynamics (QCFD) offers a promising alternative to classical computational fluid dynamics (CFD) by leveraging quantum algorithms for higher efficiency. This paper introduces a comprehensive QCFD method, including…
Fluid flow simulation is a highly active area with applications in a wide range of engineering problems and interactive systems. Meshless methods like the Moving Particle Semi-implicit (MPS) are a great alternative to deal efficiently with…
Mode-based model-reduction is used to reduce the degrees of freedom of high dimensional systems, often by describing the system state by a linear combination of spatial modes. Transport dominated phenomena, ubiquitous in technical and…
We prove an approximate max-multiflow min-multicut theorem for bounded treewidth graphs. In particular, we show the following: Given a treewidth-$r$ graph, there exists a (fractional) multicommodity flow of value $f$, and a multicut of…
We present a set of effective outflow/open boundary conditions and an associated algorithm for simulating the dynamics of multiphase flows consisting of $N$ ($N\geqslant 2$) immiscible incompressible fluids in domains involving outflows or…
We develop a method of driving a Markov processes through a continuous flow. In particular, at the level of the transition functions we investigate an approach of adding a first order operator to the generator of a Markov process, when the…