Ultrafast Synchronization via Local Observation
Physics and Society
2017-10-24 v1 Data Analysis, Statistics and Probability
Abstract
Rapid expansions of their size and frequent changes of their topology make it difficult to observe and analyze complex networks. We explore the properties of the Hankel matrix and propose an algorithm for calculating the final synchronization state that uses a local observation of a single node for a time period significantly shorter than the synchronization process. We find that synchronization can be achieved more quickly than the routine rhythm. This finding refines our understanding of the abundant ultrafast synchronization phenomena observed in nature, and it enables the efficient design of self-aligned robots.
Cite
@article{arxiv.1710.08038,
title = {Ultrafast Synchronization via Local Observation},
author = {Hai-Tao Zhang and Ming-Can Fan and Yue Wu and Jianxi Gao and H. Eugene Stanley and Tao Zhou and Ye Yuan},
journal= {arXiv preprint arXiv:1710.08038},
year = {2017}
}
Comments
6 pages, 3 figures, 2 tables