Can recurrence networks show small world property?
arXiv:1509.04528 · doi:10.1016/j.physleta.2016.06.038
Abstract
Recurrence networks are complex networks, constructed from time series data, having several practical applications. Though their properties when constructed with the threshold value εchosen at or just above the percolation threshold of the network are quite well understood, what happens as the threshold increases beyond the usual operational window is still not clear from a complex network perspective. The present Letter is focused mainly on the network properties at intermediate-to-large values of the recurrence threshold, for which no systematic study has been performed so far. We argue, with numerical support, that recurrence networks constructed from chaotic attractors with εequal to the usual recurrence threshold or slightly above cannot, in general, show small-world property. However, if the threshold is further increased, the recurrence network topology initially changes to a small-worldstructure and finally to that of a classical random graph as the threshold approaches the size of the strange attractor.
17 pages, 6 figures, published in Physics Letters A
References in corpus (6)
- From time series to complex networks: the visibility graph
- Complex Network Approach for Recurrence Analysis of Time Series
- Analytical framework for recurrence-network analysis of time series
- Complex network based techniques to identify extreme events and (sudden) transitions in spatio-temporal systems
- A non subjective approach to the GP algorithm for analysing noisy time series
- Uniform framework for the recurrence-network analysis of chaotic time series