On the stochastic flocking of the Cucker-Smale flock with randomly switching topologies
- Authors
- DONG, JIU-GANG; HA, SEUNG-YEAL; JUNG, JINWOOK; KIM, DOHEON
- Issue Date
- Aug-2020
- Publisher
- Society for Industrial and Applied Mathematics
- Keywords
- Cucker-Smale model; Directed graph; Ocking; Randomly switching topology
- Citation
- SIAM Journal on Control and Optimization, v.58, no.4, pp 2332 - 2353
- Pages
- 22
- Indexed
- SCIE
SCOPUS
- Journal Title
- SIAM Journal on Control and Optimization
- Volume
- 58
- Number
- 4
- Start Page
- 2332
- End Page
- 2353
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/114176
- DOI
- 10.1137/19M1279150
- ISSN
- 0363-0129
1095-7138
- Abstract
- We present an emergent stochastic ocking dynamics of the Cucker{Smale (CS) ensemble under randomly switching network topologies. The evolution of the CS ensemble with randomly switching topologies involves two random components (switching times and choices of network topologies at switching instants). First, we allow switching times for the network topology to be random so that the successive increments are i.i.d. processes following the common probability distribution. Second, at each switching instant, we choose a network topology randomly from a finite set of admissible network topologies whose union contains a spanning tree. Even for the fixed deterministic network topology, the CS ensemble may not exhibit a monocluster ocking, depending on the initial data and the decay mode of the communication weight functions measuring the degree of interactions between particles. For the ocking dynamics of the CS ensemble with these two random components, we first use a priori conditions on the network topologies and the uniform boundedness of the position diameter, and derive the ocking estimates via matrix theory together with a priori conditions, and then replace the a priori condition for the position diameter by some suitable condition on system parameters and communication weight. A priori conditions on the network topology will be guaranteed by the suitable spanning tree time-blocks with probability one. © 2020 Society for Industrial and Applied Mathematics.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF SCIENCE AND CONVERGENCE TECHNOLOGY > ERICA 수리데이터사이언스학과 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.