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 in order 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.

本文提供了一种简单快速的计算方法，即可将时间序列转换为图形，该方法称为可视性算法。生成的图形在结构上继承了系列的多个特性，如周期系列转换为规则图形，随机系列则转换为随机图形。 此外， 分形系列转化为无标度网络，这增强了幂律分布与分形性相关的事实。 可以利用这种新方法来从新的角度表征时间序列。