Combinatorial insights and robustness analysis for clustering in dynamical networks

Mathias Burger, Daniel Zelazo, Frank Allgower

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper studies a clustering phenomena that emerges from a dynamic network with bounded and non-linear interactions. Necessary and sufficient conditions are given describing when the network exhibits clustering. We introduce a synchronization coefficient to quantify whether a network is synchronizing or clustering and provide a robustness margin for clustering. A combinatorial description of the dynamic network clustering is provided that relates to optimal graph partitioning. Finally, the synchronization coefficient is also used for defining a set of critical disturbances that can cause the system to cluster.

Original languageEnglish
Title of host publication2012 American Control Conference, ACC 2012
Pages454-459
Number of pages6
DOIs
StatePublished - 2012
Externally publishedYes
Event2012 American Control Conference, ACC 2012 - Montreal, QC, Canada
Duration: 27 Jun 201229 Jun 2012

Publication series

NameProceedings of the American Control Conference

Conference

Conference2012 American Control Conference, ACC 2012
Country/TerritoryCanada
CityMontreal, QC
Period27/06/1229/06/12

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this