Stochastic phase-cohesiveness of discrete-time kuramoto oscillators in a frequency-dependent tree network

Matin Jafarian, Mohammad H. Mamduhi, Karl H. Johansson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents the notion of stochastic phase-cohesiveness based on the concept of recurrent Markov chains and studies the conditions under which a discrete-time stochastic Kuramoto model is phase-cohesive. It is assumed that the exogenous frequencies of the oscillators are combined with random variables representing uncertainties. A bidirectional tree network is considered such that each oscillator is coupled to its neighbors with a coupling law which depends on its own noisy exogenous frequency. In addition, an undirected tree network is studied. For both cases, a sufficient condition for the common coupling strength ( kappa) and a necessary condition for the sampling-period are derived such that the stochastic phase-cohesiveness is achieved. The analysis is performed within the stochastic systems framework and validated by means of numerical simulations.

Original languageEnglish
Title of host publication2019 18th European Control Conference, ECC 2019
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1987-1992
Number of pages6
ISBN (Electronic)9783907144008
DOIs
Publication statusPublished - Jun 2019
Externally publishedYes
Event18th European Control Conference, ECC 2019 - Naples, Italy
Duration: 25 Jun 201928 Jun 2019

Publication series

Name2019 18th European Control Conference, ECC 2019

Conference

Conference18th European Control Conference, ECC 2019
Country/TerritoryItaly
CityNaples
Period25/06/1928/06/19

Bibliographical note

Publisher Copyright:
© 2019 EUCA.

ASJC Scopus subject areas

  • Instrumentation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Stochastic phase-cohesiveness of discrete-time kuramoto oscillators in a frequency-dependent tree network'. Together they form a unique fingerprint.

Cite this