Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.12646 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912878439694336 |
|---|---|
| author | Wu, Hongjin Brandes, Ulrik |
| author_facet | Wu, Hongjin Brandes, Ulrik |
| contents | The Kuramoto model can be formulated as a gradient flow on a nonconvex energy landscape of the form $E(\boldsymbolθ) := \frac{1}{2} \sum_{1\le i,j\le n} A_{ij}\bigl(1-\cos(θ_i-θ_j)\bigr).$ A fundamental question is to identify graph structures for which this landscape is benign, in the sense that every second-order stationary point corresponds to a fully synchronized state. This property guarantees that all trajectories of the Kuramoto model converge to a fully synchronized state except for a measure-zero set of initial conditions, a phenomenon known as global synchronization. Existing guarantees typically require that each node be connected to a sufficiently large fraction of the other nodes, enforcing high graph density. In this work, we show that threshold graphs lie well outside this regime while still exhibiting global synchronization. In particular, threshold graphs realize arbitrary edge densities and have degree sequences that are extremal in the sense of majorization. Our analysis is based on a phasor--geometric characterization of stationary points that exploits the structural and geometric symmetries induced by threshold graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_12646 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Threshold graphs are globally synchronizing Wu, Hongjin Brandes, Ulrik Dynamical Systems Classical Analysis and ODEs Combinatorics Optimization and Control 90C26, 90C35, 34D06, 37N20, 05C75 G.2.2 The Kuramoto model can be formulated as a gradient flow on a nonconvex energy landscape of the form $E(\boldsymbolθ) := \frac{1}{2} \sum_{1\le i,j\le n} A_{ij}\bigl(1-\cos(θ_i-θ_j)\bigr).$ A fundamental question is to identify graph structures for which this landscape is benign, in the sense that every second-order stationary point corresponds to a fully synchronized state. This property guarantees that all trajectories of the Kuramoto model converge to a fully synchronized state except for a measure-zero set of initial conditions, a phenomenon known as global synchronization. Existing guarantees typically require that each node be connected to a sufficiently large fraction of the other nodes, enforcing high graph density. In this work, we show that threshold graphs lie well outside this regime while still exhibiting global synchronization. In particular, threshold graphs realize arbitrary edge densities and have degree sequences that are extremal in the sense of majorization. Our analysis is based on a phasor--geometric characterization of stationary points that exploits the structural and geometric symmetries induced by threshold graphs. |
| title | Threshold graphs are globally synchronizing |
| topic | Dynamical Systems Classical Analysis and ODEs Combinatorics Optimization and Control 90C26, 90C35, 34D06, 37N20, 05C75 G.2.2 |
| url | https://arxiv.org/abs/2511.12646 |