Synchronization in Random Geometric Graphs
arXiv:0801.3044 · doi:10.1142/S0218127409023044
Abstract
In this paper we study the synchronization properties of random geometric graphs. We show that the onset of synchronization takes place roughly at the same value of the order parameter that a random graph with the same size and average connectivity. However, the dependence of the order parameter with the coupling strength indicates that the fully synchronized state is more easily attained in random graphs. We next focus on the complete synchronized state and show that this state is less stable for random geometric graphs than for other kinds of complex networks. Finally, a rewiring mechanism is proposed as a way to improve the stability of the fully synchronized state as well as to lower the value of the coupling strength at which it is achieved. Our work has important implications for the synchronization of wireless networks, and should provide valuable insights for the development and deployment of more efficient and robust distributed synchronization protocols for these systems.
5 pages, 4 figures
References in corpus (12)
- Synchronization reveals topological scales in complex networks
- Network Synchronization, Diffusion, and the Paradox of Heterogeneity
- Paths to Synchronization on Complex Networks
- Entangled networks, synchronization, and optimal network topology
- Universality in the synchronization of weighted random networks
- Modular synchronization in complex networks
- Clustering and Synchronization of Oscillator Networks
- Synchronizability determined by coupling strengths and topology on Complex Networks
- Dynamical and spectral properties of complex networks
- Worm Epidemics in Wireless Adhoc Networks
- Optimized network structure and routing metric in wireless multihop ad hoc communication
- Distributive routing & congestion control in wireless multihop ad hoc communication networks
Cited by in corpus (17)
- Synchronization in complex networks
- Synchronization of interconnected networks: the role of connector nodes
- Random geometric graphs with general connection functions
- Velocity-enhanced Cooperation of Moving Agents playing Public Goods Games
- Cascading failures in spatially-embedded random networks
- Random Rectangular Graphs
- Epidemic Spreading in Random Rectangular Networks
- Spectral statistics of random geometric graphs
- Topological versus spectral properties of random geometric graphs
- Random spherical graphs
- Symmetric motifs in random geometric graphs
- Comfort-driven mobility produces spatial fragmentation in Axelrod's model
- Non-uniform random graphs on the plane: A scaling study
- Expander graphs are globally synchronizing
- Weighted random--geometric and random--rectangular graphs: Spectral and eigenfunction properties of the adjacency matrix
- The Impact of Social Attractiveness on Casual Group Formation: Power-Law Group Sizes and Suppressed Percolation
- Effects of long-range links on metastable states in a dynamic interaction network