Paths towards synchronization: analytical treatment of completely connected networks
- 9 May 2023
- journal article
- research article
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 56 (22) , 225202
Abstract
We describe the transient regime of synchronizing flows defined over a network, introducing a codification of the paths towards synchronization. In all cases, the collection of paths toward synchronization defines a combinatorial structure: the transition diagram. In this paper, besides introducing this general framework, we study in full detail the case of completely connected networks where a monotonic convergence towards synchronization takes place. For these systems we are able to supply a detailed analytical description of the transition diagram describing both, the Laplacian flow and a special case of the Kuramoto model on the same network. This constitutes a first instance of a full symbolic description of the path towards synchronization and illustrates the hidden complexity of the transient regime.Keywords
Funding Information
- Secretaría de Ciencia, Humanidades, Tecnología e Innovación (Scholarship 722957)
- ECOS-CONACyT-ANUIES (M16M01)
This publication has 11 references indexed in Scilit:
- Counting Dyck Paths by Area and RankAnnals of Combinatorics, 2014
- Modeling Temporal Networks Using Random ItinerariesPhysical Review Letters, 2013
- Synchronization in complex networksPhysics Reports, 2008
- Synchronization Reveals Topological Scales in Complex NetworksPhysical Review Letters, 2006
- On directed-convex polyominoes in a rectangleDiscrete Mathematics, 2005
- Space–time complexity in Hamiltonian dynamicsChaos: An Interdisciplinary Journal of Nonlinear Science, 2003
- Jets, stickiness, and anomalous transportPhysical Review E, 2002
- From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillatorsPhysica D: Nonlinear Phenomena, 2000
- Two element lattice permutation numbers and their q-generalizationDuke Mathematical Journal, 1964
- A combinatorial problem.The Michigan Mathematical Journal, 1952