Cross over of recurrence networks to random graphs and random geometric graphs |
| |
Authors: | RINKU JACOB K P HARIKRISHNAN R MISRA G AMBIKA |
| |
Affiliation: | 1.Department of Physics,The Cochin College,Cochin,India;2.Inter-University Centre for Astronomy and Astrophysics,Pune,India;3.Indian Institute of Science Education and Research,Pune,India |
| |
Abstract: | Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability density variations of the representative attractor from which it is constructed. Here we numerically investigate the properties of recurrence networks from standard low-dimensional chaotic attractors using some basic network measures and show how the recurrence networks are different from random and scale-free networks. In particular, we show that all recurrence networks can cross over to random geometric graphs by adding sufficient amount of noise to the time series and into the classical random graphs by increasing the range of interaction to the system size. We also highlight the effectiveness of a combined plot of characteristic path length and clustering coefficient in capturing the small changes in the network characteristics. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|