Related papers: Dynamic Flows with Time-Dependent Capacities
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed over time by choosing a sequence of capacity labelings from…
In this note we analyze a model for a unidirectional unsteady flow of a viscous incompressible fluid with time dependent viscosity. A possible way to take into account such behaviour is to introduce a memory formalism, including thus the…
Networked systems are susceptible to cascading failures, where the failure of an initial set of nodes propagates through the network, often leading to system-wide failures. In this work, we propose a multiplex flow network model to study…
We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to…
In this paper, we are concerned with the resilience of locally routed network flows with finite link capacities. In this setting, an external inflow is injected to the so-called origin nodes. The total inflow arriving at each node is routed…
Next-generation distributed computing networks (e.g., edge and fog computing) enable the efficient delivery of delay-sensitive, compute-intensive applications by facilitating access to computation resources in close proximity to end users.…
We consider a curve with boundary points free to move on a line in $\mathbb R^2$, which evolves by the $L^2$--gradient flow of the elastic energy, that is a linear combination of the Willmore and the length functional. For such planar…
The present research is devoted to the problem of stability of the fluid flow moving in a channel with flexible walls and interacting with the walls, which are subject to traveling waves. Experimental data shows that the energy of the…
The boundary conditions prescribing the constant traction or the so-called do-nothing conditions are frequently taken on artificial boundaries in the numerical simulations of steady flow of incompressible fluids, despite the fact that they…
Transmission-constrained problems in power systems can be cast as polynomial optimization problems whose coefficients vary over time. We consider the complications therein and suggest several approaches. On the example of the…
We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof…
This paper deals with robust optimization applied to network flows. Two robust variants of the minimum-cost integer flow problem are considered. Thereby, uncertainty in problem formulation is limited to arc unit costs and expressed by a…
The parallel computational complexity or depth of growing network models is investigated. The networks considered are generated by preferential attachment rules where the probability of attaching a new node to an existing node is given by a…
In multi-hop wireless networks, flow demands mean that some nodes have routing demands of transmitting their data to other nodes with a certain level of transmission rate. When a set of nodes have been deployed with flow demands, it is…
We present a notion of super Ricci flow for time-dependent finite weighted graphs. A challenging feature is that these flows typically encounter singularities where the underlying graph structure changes. Our notion is robust enough to…
The main objective of this article is to study both dynamic and structural transitions of the Taylor-Couette flow, using the dynamic transition theory and geometric theory of incompressible flows developed recently by the authors. In…
We consider load scheduling on constrained continuous-time linear dynamical systems, such as automated irrigation and other distribution networks. The requested loads are rigid, i.e., the shapes cannot be changed. Hence, it is only possible…
Subject of research is complex networks and network systems. The network system is defined as a complex network in which flows are moved. Classification of flows in the network is carried out on the basis of ordering and continuity. It is…
The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a…
Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems -- streets, tracks, etc. -- are inherently undirected and directions are only imposed on them to reduce the danger of…