scholarly journals Graph-Theoretic Approach to Exponential Stability of Delayed Coupled Systems on Networks under Periodically Intermittent Control

2018 ◽  
Vol 23 (1) ◽  
pp. 44-63
Author(s):  
Beibei Guo ◽  
Yu Xiao ◽  
Chiping Zhang
Keyword(s):  
Exponential Stability ◽  
Type Theorem ◽  
Sufficient Conditions ◽  
Coupled Systems ◽  
Intermittent Control ◽  
Theoretic Approach ◽  
Periodically Intermittent Control ◽  
Graph Theoretic ◽  
Graph Theoretic Approach ◽  
Close Relationship

In this paper, the exponential stability of delayed coupled systems on networks (DCSNs) is investigated via periodically intermittent control. By utilizing graph-theoretic approach and Lyapunov function method, a novel method for stability analysis of DCSNs is developed. Moreover, some useful and easily verifiable sufficient conditions are presented in the form of Lyapunov-type theorem and coefficients-type criterion. These laws reveal that the stability has a close relationship with the topol- ogy structure of the networks. In addition, as a subsequent result, the obtained theory is successfully applied to study the exponential stability of delayed coupled oscillators on networks under periodically intermittent control. Finally, a numerical example is given to validate the effectiveness of theoretical results.

scholarly journals Novel Lagrange sense exponential stability criteria for time-delayed stochastic Cohen–Grossberg neural networks with Markovian jump parameters: A graph-theoretic approach

2020 ◽  
Vol 25 (5) ◽  
Author(s):  
Iswarya Manickam ◽  
Raja Ramachandran ◽  
Grienggrai Rajchakit ◽  
Jinde Cao ◽  
Chuangxia Huang
Keyword(s):  
Neural Networks ◽  
Exponential Stability ◽  
Sufficient Conditions ◽  
Theoretic Approach ◽  
Markovian Jump ◽  
Markovian Jumping ◽  
Markovian Jump Parameters ◽  
Graph Theoretic ◽  
Mixed Time Delays ◽  
Graph Theoretic Approach

This paper concerns the issues of exponential stability in Lagrange sense for a class of stochastic Cohen–Grossberg neural networks (SCGNNs) with Markovian jump and mixed time delay effects. A systematic approach of constructing a global Lyapunov function for SCGNNs with mixed time delays and Markovian jumping is provided by applying the association of Lyapunov method and graph theory results. Moreover, by using some inequality techniques in Lyapunov-type and coefficient-type theorems we attain two kinds of sufficient conditions to ensure the global exponential stability (GES) through Lagrange sense for the addressed SCGNNs. Ultimately, some examples with numerical simulations are given to demonstrate the effectiveness of the acquired result.

scholarly journals Rearrangeable and Repackable S-W-S Elastic Optical Networks for Connections with Limited Bandwidths

2020 ◽  
Vol 10 (4) ◽  
pp. 1251
Author(s):  
Bey-Chi Lin
Keyword(s):  
Optical Networks ◽  
Sufficient Conditions ◽  
Utilization Efficiency ◽  
Theoretic Approach ◽  
Graph Theoretic ◽  
Second Stage ◽  
Switching Fabric ◽  
Graph Theoretic Approach ◽  
Switching Fabrics ◽  
Strictly Nonblocking

Elastic optical networks flexibly allocate bandwidth to a connection for improving utilization efficiency. The paper considers an optical node architecture that is similar to a three-stage Clos network for elastic optical networks. The architecture, which employs space switching in the first and the third stages and wavelength switching in the second stage, is called an S-W-S switching fabric. In this paper, we propose a graph-theoretic approach and different routing algorithms to derive the sufficient conditions under which an S-W-S switching fabric will be rearrangeable nonblocking and repackable nonblocking. The proposed rearrangeable and repackable nonblocking S-W-S switching fabrics for connections with limited bandwidths consume around half the number of middle wavelength switches compared to strictly nonblocking S-W-S switching fabrics.

Sign in / Sign up

Export Citation Format

Share Document