Related papers: Balanced flows for transshipment problems
In this article we present a novel staggered semi-implicit hybrid finite-volume/finite-element (FV/FE) method for the resolution of weakly compressible flows in two and three space dimensions. The pressure-based methodology introduced in…
We investigate how the underlying graph of a network supports a flow between a source node and a destination node and propose to compute the expected number of nodes and links that contribute to transferring items in random graphs. Since…
The support of a flow $x$ in a network is the subdigraph induced by the arcs $uv$ for which $x(uv)>0$. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of…
Standard and anomalous transport in incompressible flow is investigated using multiscale techniques. Eddy-diffusivities emerge from the multiscale analysis through the solution of an auxiliary equation. From the latter it is derived an…
Normalizing flows and variational autoencoders are powerful generative models that can represent complicated density functions. However, they both impose constraints on the models: Normalizing flows use bijective transformations to model…
We provide universally-optimal distributed graph algorithms for $(1+\varepsilon)$-approximate shortest path problems including shortest-path-tree and transshipment. The universal optimality of our algorithms guarantees that, on any $n$-node…
Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering…
A multiflow in a planar graph is uncrossed if its support paths do not cross. Recently such flows have played a role in approximation algorithms for maximum disjoint paths in "fully-planar" instances, where the combined supply-demand graph…
We analyse the inter-scale transfer of energy for two types of plane Poiseuille flow: the P4U exact coherent state of Park and Graham (2015) and turbulent flow in a minimal channel. For both flows, the dominant energy-producing modes are…
This paper is concerned with an interaction problem between a full compressible, electrically conducting fluid and a thermoelastic shell in a two-dimensional setting. The shell is modelled by linear thermoelasticity equations, and…
The equations of stationary compressible flows of active liquid crystals are considered in a bounded three-dimensional domain. The system consists of the stationary Navier-Stokes equations coupled with the equation of Q-tensors and the…
In fluid dynamics, an important problem is linked to the knowledge of the fluid pressure. Recently, another approach to study incompressible fluid flow was suggested. It consists in using a general pressure equation (GPE) derived from…
We derive a monotonicity property for general, transient flows of a commodity transferred throughout a network, where the flow is characterized by density and mass flux dynamics on the edges with density continuity and mass balance…
This paper is concerned with six variational problems and their mutual connections: The quadratic Monge-Kantorovich optimal transport, the Schr\"odinger problem, Brenier's relaxed model for incompressible fluids, the so-called Br\"odinger…
The presented paper studies the flow number $F(G,\sigma)$ of flow-admissible signed graphs $(G,\sigma)$ with two negative edges. We restrict our study to cubic graphs, because for each non-cubic signed graph $(G,\sigma)$ there is a set…
Simplicial complexes are generalizations of graphs that describe higher-order network interactions among nodes in the graph. Network dynamics described by graph Laplacian flows have been widely studied in network science and control theory,…
We consider the worst-case load-shedding problem in electric power networks where a number of transmission lines are to be taken out of service. The objective is to identify a pre-specified number of line outage that leads to the maximum…
When the time-reversal and parity symmetries in a fluid are broken, transverse transport coefficients can arise in response to perturbations, an example being odd viscosity. We refer to these systems as odd fluids. While much progress has…
A directed graph $G=(V,E)$ is {\it strongly pseudo transitive} if there is a partition $\{A,E-A\}$ of $E$ so that graphs $G_1=(V,A)$ and $G_2=(V,E-A)$ are transitive, and additionally, if $ab\in A$ and $bc\in E $ implies that $ac\in E$. A…
We provide some general theoretical results to guide the optimization of transverse hydrodynamic phenomena in superhydrophobic channels. Our focus is on the canonical micro- and nanofluidic geometry of a parallel-plate channel with an…