scholarly journals Global asymptotic stability of nonlinear circuits related to maximum flow problems

2011 ◽  
Vol 2 (4) ◽  
pp. 432-442
Author(s):  
Norikazu Takahashi
Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1716
Author(s):  
Adrian Marius Deaconu ◽  
Delia Spridon

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the proposed algorithm can be used to quickly build a vast number of networks as well as large-scale networks especially designed for s-t flows.


Author(s):  
Rachida Mezhoud ◽  
Khaled Saoudi ◽  
Abderrahmane Zaraï ◽  
Salem Abdelmalek

AbstractFractional calculus has been shown to improve the dynamics of differential system models and provide a better understanding of their dynamics. This paper considers the time–fractional version of the Degn–Harrison reaction–diffusion model. Sufficient conditions are established for the local and global asymptotic stability of the model by means of invariant rectangles, the fundamental stability theory of fractional systems, the linearization method, and the direct Lyapunov method. Numerical simulation results are used to illustrate the theoretical results.


Sign in / Sign up

Export Citation Format

Share Document