Related papers: Balanced flows for transshipment problems
Let $G=(V,E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $\lambda(G)$, is the cardinality of a minimum edge-cut of $G$. We call $G$ maximally edge-connected if $\lambda(G)=\delta(G)$, and $G$…
We study transport of a weakly diffusive pollutant (a passive scalar) by thermoconvective flow in a fluid-saturated horizontal porous layer heated from below under frozen parametric disorder. In the presence of disorder (random frozen…
The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges incident to a common vertex is permitted or forbidden; a walk is compatible if all pairs…
We combine several recent advancements to solve $(1+\varepsilon)$-transshipment and $(1+\varepsilon)$-maximum flow with a parallel algorithm with $\tilde{O}(1/\varepsilon)$ depth and $\tilde{O}(m/\varepsilon)$ work. We achieve this by…
This paper deals with the optimal streaky perturbations (which maximize the perturbed energy growth) in a wedge flow boundary layer. These three dimensional perturbations are governed by a system of linearized boundary layer equations…
A graph $G=(V,E)$ is called equidominating if there exists a value $t \in \mathbb{N}$ and a weight function $\omega : V \rightarrow \mathbb{N}$ such that the total weight of a subset $D\subseteq V$ is equal to $t$ if and only if $D$ is a…
In the problem Fault-Tolerant Path (FTP), we are given an edge-weighted directed graph G = (V, E), a subset U \subseteq E of vulnerable edges, two vertices s, t \in V, and integers k and \ell. The task is to decide whether there exists a…
The damped nonlinear wave equation, also known as the nonlinear telegraph equation, is studied within the framework of semigroups and eigenfunction approximation. The linear semigroup assumes a central role: it is bounded on the domain of…
We consider approximation algorithms for the problem of finding $x$ of minimal norm $\|x\|$ satisfying a linear system $\mathbf{A} x = \mathbf{b}$, where the norm $\|\cdot \|$ is arbitrary and generally non-Euclidean. We show a simple…
We propose a model of optimal parallel transport between vector fields on a connection graph, which consists of a weighted graph along with a map from its edges to an orthogonal group. Inspired by the well-known equivalence of 1-Wasserstein…
Generative models based on flow matching have demonstrated remarkable success in various domains, yet they suffer from a fundamental limitation: the lack of interpretability in their intermediate generation steps. In fact these models learn…
In this paper, controllability of undirected networked systems with {diffusively coupled subsystems} is considered, where each subsystem is of {identically {\emph{fixed}}} general high-order single-input-multi-output dynamics. The…
System reliability is the probability of the maximum flow in a stochastic-flow network from the source node to the sink node being more than a demand level d. There are several approaches to compute system reliability using upper boundary…
We propose a finite volume scheme for computing two-fluid flows in variable cross-section ducts. Our scheme satisfies a well-balanced property. It is based on the VFRoe approach. The VFRoe variables are the Riemann invariants of the…
An inverse problem of wave propagation into a weakly laterally inhomogeneous medium occupying a half-space is considered in the acoustic approximation. The half-space consists of an upper layer and a semi-infinite bottom separated with an…
We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol…
A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…
We consider a linearised model of incompressible inviscid flow. Using a regularisation based on the Hodge Laplacian we prove existence and uniqueness of weak solutions for smooth domains. The model problem is then discretised using…
The flow of viscoelastic fluids in channels and pipes remain poorly understood, particularly at low Reynolds numbers. Here, we investigate the flow of polymeric solutions in straight channels using pressure measurements and particle…
We consider the Dirichlet problem for a compressible two-fluid model in three dimensions, and obtain the global existence of weak solution with large initial data and independent adiabatic constants \Gamma,\gamma>=9/5. The pressure…