Related papers: Balanced flows for transshipment problems
In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths with ends in T such that the total weights of paths traversing…
Numerous networks, such as transportation, distribution and delivery networks optimize their designs in order to increase efficiency and lower costs, improving the stability of its intended functions, etc. Networks that distribute goods,…
Sampling conditional distributions is a fundamental task for Bayesian inference and density estimation. Generative models, such as normalizing flows and generative adversarial networks, characterize conditional distributions by learning a…
We model a 3D turbulent fluid, evolving toward a statistical equilibrium, by adding to the equations for the mean field $(v, p)$ a term like $-\alpha \nabla\cdot(\ell(x) D v_t)$. This is of the Kelvin-Voigt form, where the Prandtl mixing…
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under…
Consider a routing problem consisting of a demand graph H and a supply graph G. If the pair obeys the cut condition, then the flow-cut gap for this instance is the minimum value C such that there is a feasible multiflow for H if each edge…
The moving discontinuous Galerkin finite element method with interface condition enforcement (MDG-ICE) is applied to the case of viscous flows. This method uses a weak formulation that separately enforces the conservation law, constitutive…
We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V, E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E…
The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. The reassembling process has a simple formulation (there are several equivalent formulations) relative to…
This text is an introduction to the author's cohomological approach, based on Hodge theory, to (effective) unique ergodicity and weak mixing of translation flows. Compared to earlier expositions, it emphasizes the analogy between the two…
We introduce a methodology to study the possible matter flows of an ecosystem defined by observational biomass data and realistic biological constraints. The flows belong to a polyhedron in a multi dimensional space making statistical…
Hadamard diagonalizable graphs are undirected graphs for which the corresponding Laplacian is diagonalizable by a Hadamard matrix. Such graphs have been studied in the context of quantum state transfer. Recently, the concept of a weak…
We consider a situation commonly encountered in microfluidics: two streams of miscible liquids are brought at a junction to flow side by side within a microchannel, allowing solutes to diffuse from one stream to the other and possibly…
We study the well-established problem of finding an optimal routing of unsplittable flows in a graph. While by now there is an extensive body of work targeting the problem on graph classes such as paths and trees, we aim at using the…
The aim of this paper is to present how data collected from a water distribution network (WDN) can be used to reconstruct flow rate and flow direction all over the network to enhance knowledge and detection of unforeseen events. The…
For a finite metric graph $X=(V,E,\ell)$, where $V$ is endowed with the shortest path metric, we consider the transportation cost problem associated with the distance $d$ on $V$. Namely, for $f$ a function with total sum 0 on $V$, write…
In this paper, we introduce the solver ConvexFlows for the convex flow problem first defined in the authors' previous work. In this problem, we aim to optimize a concave utility function depending on the flows over a graph. However, unlike…
We study dynamic network flows with uncertain input data under a robust optimization perspective. In the dynamic maximum flow problem, the goal is to maximize the flow reaching the sink within a given time horizon $T$, while flow requires a…
A conservative flux postprocessing algorithm is presented for both steady-state and dynamic flow models. The postprocessed flux is shown to have the same convergence order as the original flux. An arbitrary flux approximation is projected…
We present the derivation of a new unidirectional model for We present the derivation of a new unidirectional model for unsteady mixed flows in non uniform closed water pipes. We introduce a local reference frame to take into account the…