Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.15944 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915747487285248 |
|---|---|
| author | Ostilli, Massimo |
| author_facet | Ostilli, Massimo |
| contents | Partitioning large networks into stable clusters of synchronized nodes is a challenging task. Recent approaches based on spectral analysis can provide exact results on specific dynamics but remain unfeasible for very large networks. Moreover, within a stochastic framework, it is unclear which dynamics should be chosen to study synchronization. Here we propose an unbiased and scalable method based on the message-passing algorithm. By exploiting the collective behavior emerging across critical points of an effective Ising-like model, we identify dynamically coherent clusters of synchronized nodes and illustrate the approach on some large real-world networks. We find that, unlike continuous-time dynamics, abrupt desyncrhronization occurs even in simple graphs, without the need to invoke higher order interactions. However, when noise is included, the transition to synchronization becomes smoother and proceeds through the formation of plateaus, albeit at the cost of requiring larger coupling strengths. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_15944 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach Ostilli, Massimo Physics and Society Disordered Systems and Neural Networks Data Analysis, Statistics and Probability 92B20 E.1; J.0 Partitioning large networks into stable clusters of synchronized nodes is a challenging task. Recent approaches based on spectral analysis can provide exact results on specific dynamics but remain unfeasible for very large networks. Moreover, within a stochastic framework, it is unclear which dynamics should be chosen to study synchronization. Here we propose an unbiased and scalable method based on the message-passing algorithm. By exploiting the collective behavior emerging across critical points of an effective Ising-like model, we identify dynamically coherent clusters of synchronized nodes and illustrate the approach on some large real-world networks. We find that, unlike continuous-time dynamics, abrupt desyncrhronization occurs even in simple graphs, without the need to invoke higher order interactions. However, when noise is included, the transition to synchronization becomes smoother and proceeds through the formation of plateaus, albeit at the cost of requiring larger coupling strengths. |
| title | Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an unbiased scalable approach |
| topic | Physics and Society Disordered Systems and Neural Networks Data Analysis, Statistics and Probability 92B20 E.1; J.0 |
| url | https://arxiv.org/abs/2601.15944 |