期刊论文详细信息
Pramana
Cross over of recurrence networks to random graphs and random geometric graphs
G AMBIKA3  R MISRA2  RINKU JACOB1  K P HARIKRISHNAN11 
[1] Department of Physics, The Cochin College, Cochin 682 002, India$$;Inter-University Centre for Astronomy and Astrophysics, Ganeshkhind, Pune 411 007, India$$;Indian Institute of Science Education and Research, Dr Homi Bhabha Road, Pashan, Pune 411 008, India$$
关键词: Chaotic time series;    complex networks;    random graphs.;   
DOI  :  
学科分类:物理(综合)
来源: Indian Academy of Sciences
PDF
【 摘 要 】

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 densityvariations 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 measuresand 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 tothe 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.

【 授权许可】

Unknown   

【 预 览 】
附件列表
Files Size Format View
RO201912040499522ZK.pdf 233KB PDF download
  文献评价指标  
  下载次数:11次 浏览次数:16次