Related Experiment Video
Updated: Mar 23, 2026

Automated, Quantitative Cognitive/Behavioral Screening of Mice: For Genetics, Pharmacology, Animal Cognition and Undergraduate Instruction
Published on: February 26, 2014
Discrete-time systems with random switches: From systems stability to networks synchronization
Yao Guo1, Wei Lin1, Daniel W C Ho2
1School of Mathematical Sciences and Centre for Computational Systems Biology, Fudan University, Shanghai 200433, China.
This study presents new methods for analyzing random switching systems, ensuring stability and synchronization even with complex, unbounded distributions. These findings advance the understanding of complex dynamical networks with random connections.
Area of Science:
- Control Theory
- Network Science
- Stochastic Systems
Background:
- Discrete-time systems with random switches present challenges in stability and synchronization analysis.
- Unbounded and continuous-valued distributions in switching matrices add complexity.
- Understanding random connections is crucial for complex dynamical networks.
Purpose of the Study:
- To develop analytical approaches for identifying stability patterns in randomly switching discrete-time systems.
- To investigate and ensure almost sure synchronization in complex dynamical networks with random connections.
- To explore synchronization in networks with nonlinear maps and large population sizes.
Main Methods:
- Analytical identification of essential patterns for almost sure stability.
- Investigation of almost sure synchronization using probability space configurations.
- Numerical simulations to validate theoretical results and demonstrate preserved chaotic dynamics.
Main Results:
- Developed approaches accurately identify stability guarantees for discrete-time systems with random switches, even with unbounded distributions.
- Achieved almost sure synchronization in complex dynamical networks, preserving chaotic dynamics under specific statistical parameters.
- Demonstrated the possibility of achieving synchronization in large-scale randomly switching networks, outperforming deterministic approaches.
Conclusions:
- The developed analytical methods provide robust guarantees for stability and synchronization in complex stochastic systems.
- Random switching and connections can facilitate synchronization in large networks, offering advantages over deterministic configurations.
- The research contributes to the theoretical understanding and practical application of control in complex dynamical networks.
More Related Videos
Related Concept Videos
Classification of Systems-II
Random Variables
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
BIBO stability of continuous and discrete -time systems
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
Basic Discrete Time Signals
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
Linear time-invariant Systems
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
Basic Continuous Time Signals
The unit step function, denoted u(t), is zero for negative time values and one for positive time values, exhibiting a discontinuity at t=0. This function often represents abrupt changes, such as the step voltage introduced when turning a car's...

