可见性图
系列(地层学)
随机图
计算机科学
复杂网络
分形
几何级数
图形
时间序列
随机几何图
理论计算机科学
算法
能见度
图论
幂级数
数学
折线图
机器学习
组合数学
电压图
物理
光学
数学分析
万维网
正多边形
古生物学
生物
几何学
作者
Lucas Lacasa,Bartolo Luque,Fernando J. Ballesteros,Jordi Luque,Juan Carlos Nuño
标识
DOI:10.1073/pnas.0709247105
摘要
In this work we present a simple and fast computational method, the visibility algorithm, that converts a time series into a graph. The constructed graph inherits several properties of the series in its structure. Thereby, periodic series convert into regular graphs, and random series do so into random graphs. Moreover, fractal series convert into scale-free networks, enhancing the fact that power law degree distributions are related to fractality, something highly discussed recently. Some remarkable examples and analytical tools are outlined to test the method's reliability. Many different measures, recently developed in the complex network theory, could by means of this new approach characterize time series from a new point of view.
科研通智能强力驱动
Strongly Powered by AbleSci AI