Skip to main content

From time series to graph thru visibility algorithm.

Project description

This python package is an implementation of the algorithm described in the article: From time series to complex networks: The visibility graph.

Installation

Install library, perhaps within a virtualenv:

$ pip install visibility_graph

The gist

“In this graph, every node corresponds, in the same order, to series data, and two nodes are connected if visibility exists between the corresponding data, that is to say, if there is a straight line that connects the series data, provided that this “visibility line” does not intersect any intermediate data height.”

http://www.pnas.org/content/105/13/4972/F1.medium.gif

“More formally, we can establish the following visibility criteria: two arbitrary data values (t a, y a) and (t b, y b) will have visibility, and consequently will become two connected nodes of the associated graph, if any other data (t c, y c) placed between them fulfills:”

http://www.pnas.org/content/105/13/4972/embed/graphic-2.gif

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

visibility_graph-0.1.tar.gz (2.5 kB view hashes)

Uploaded Source

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page