Graph conductance, synchronization, and a new bottleneck measure
C. Tyler Diggans

TL;DR
This paper introduces a new graph measure called the synchronization bottleneck, which better predicts the coupling strength needed for stable synchronization in networked dynamical systems than traditional conductance.
Contribution
The paper defines the synchronization bottleneck measure, $\\Xi$, providing a more accurate quantification of flow limitations affecting stable synchronization in networks.
Findings
The new measure controls the coupling strength for stable synchronization.
Heuristics based on the measure can guide decentralized network improvements.
The measure generalizes conductance to account for all nodes in the system.
Abstract
As a quantification of the main bottleneck to flow over a graph, the network property of conductance plays an important role in the process of synchronization of network-coupled dynamical systems. Diffusive coupling terms serve not only to exchange information between nodes within a networked system, but ultimately to dissipate the entropy of the collective dynamic state down toward that which can be associated with a single dynamic node when the synchronization manifold is stable. While the graph conductance can characterize the coupling strength that is required to maintain widespread synchronization across a majority of the nodes in such a system, it offers no guarantee for a stable synchronization manifold, which involves all nodes in the system. We define a new measure called the synchronization bottleneck of a graph, which we denote by ; this new network property provides a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
