arXiv · 2102.06957
Identifying symmetries and predicting cluster synchronization in complex networks
Abstract
Symmetries in a network connectivity regulate how the graph's functioning organizes into clustered states. Classical methods for tracing the symmetry group of a network require very high computational costs, and therefore they are of hard, or even impossible, execution for large sized graphs. We here unveil that there is a direct connection between the elements of the eigen-vector centrality and the clusters of a network. This gives a fresh framework for cluster analysis in undirected and connected graphs, whose computational cost is linear in $N$. We show that the cluster identification is in perfect agreement with symmetry based analyses, and it allows predicting the sequence of synchronized clusters which form before the eventual occurrence of global synchronization.
Explore related subjects
Keep this discovery
Pitambar Khanra, Subrata Ghosh, Karin Alfaro-Bittner, Prosenjit Kundu, Stefano Boccaletti, Chittaranjan Hens, Pinaki Pal. 2021-02-13. Identifying symmetries and predicting cluster synchronization in complex networks. https://doi.org/10.1016/j.chaos.2021.111703
Cite the original work for its findings. Save a collection to share your selection of sources.