Related papers: Dynamic Flows with Time-Dependent Capacities
In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…
We study a 2D potential flow of an ideal fluid with a free surface with decaying conditions at infinity. By using the conformal variables approach, we study a particular solution of Euler equations having a pair of square-root branch points…
Interpreting RG flows as dynamical systems in the space of couplings we produce a variety of constraints, global (topological) as well as local. These constraints, in turn, rule out some of the proposed RG flows and also predict new phases…
A dynamical systems approach to turbulence envisions the flow as a trajectory through a high-dimensional state space transiently visiting the neighbourhoods of unstable simple invariant solutions (E. Hopf, Commun. Appl. Maths 1, 303, 1948).…
Modern network systems, such as transportation and communication systems, are prone to cyber-physical disruptions and thus suffer efficiency loss. This paper studies network resiliency, in terms of throughput, and develops resilient control…
This paper investigates the robustness of strong structural controllability for linear time-invariant and linear time-varying directed networks with respect to structural perturbations, including edge deletions and additions. In this…
We present a unified method, based on convex optimization, for managing the power produced and consumed by a network of devices over time. We start with the simple setting of optimizing power flows in a static network, and then proceed to…
The article studies edge coverage for control flow graphs extended with explicit constraints. Achieving a given level of white-box coverage for a given code is a classic problem in software testing. We focus on designing test sets that…
The dynamics of transitional flows are governed by an interplay between the non-normal linear dynamics and quadratic nonlinearity in the incompressible Navier-Stokes equations. In this work, we propose a framework for nonlinear stability…
We consider a linear transport equation on the edges of a network with time-varying coefficients. Using methods for non-autonomous abstract Cauchy problems, we obtain well-posedness of the problem and describe the asymptotic profile of the…
We consider the problem of Data Flow Analysis over monotone data flow frameworks with a finite lattice. The problem of computing the Maximum Fixed Point (MFP) solution is shown to be P-complete even when the lattice has just four elements.…
We study dynamic networks under an undirected consensus communication protocol and with one state-dependent weighted edge. We assume that the aforementioned dynamic edge can take values over the whole real numbers, and that its behaviour…
In the Time-Windows Unsplittable Flow on a Path problem (twUFP) we are given a resource whose available amount changes over a given time interval (modeled as the edge-capacities of a given path $G$) and a collection of tasks. Each task is…
Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is among the most natural frameworks. Roughly speaking, herein one…
We consider a class of fixed-charge transportation problems over graphs. We show that this problem is strongly NP-hard, but solvable in pseudo-polynomial time over trees using dynamic programming. We also show that the LP formulation…
In network flow problems, there is a well-known one-to-one relationship between extreme points of the feasibility region and trees in the associated undirected graph. The same is true for the dual differential problem. In this paper, we…
In three space dimensions, we consider the compressible inviscid model describing the time evolution of two fluids sharing the same velocity and enjoying the algebraic pressure closure. By employing the technique of convex integration, we…
A network-based analysis of a turbulent channel flow numerically solved at $Re_\tau=180$ is proposed as an innovative perspective for the spatial characterization of the flow field. Two spatial networks corresponding to the streamwise and…
The effect of a network of fixed rigid fibers on fluid flow is investigated by means of three-dimensional direct numerical simulations using an immersed boundary method for the fluid-structure coupling. Different flows are considered (i.e.,…
The computational capabilities of a neural network are widely assumed to be determined by its static architecture. Here we challenge this view by establishing that a fixed neural structure can operate in fundamentally different…