Research My IBM Log in
Conference paper

Synchronization in arrays of chaotic circuits coupled via hypergraphs: Static and dynamic coupling

Abstract

When an array of circuits is coupled via coupling elements which connects two circuits at a time, the underlying coupling topology can be represented as a graph. When the coupling element connects more than two circuits at a time, the underlying coupling topology can be represented as a hypergraph. In this paper, we study the synchronization properties in arrays of chaotic circuits where the underlying coupling topology is a hypergraph. We consider the case where the coupling is due to memoryless (static) components, and the case where the coupling is due to dynamic circuit components. We introduce the algebraic connectivity of a hypergraph and show how it can be used to derive sufficient conditions for synchronization.

Semiconductors Artificial Intelligence Quantum Computing Hybrid Cloud About Publications Blog Events Careers Contact Research Topics People Projects Newsletter X LinkedIn YouTube RSS Contact IBM Privacy Terms of use Accessibility