Skip to main content

A tool to detect the backbone in temporal networks

Project description

A tool to detect the backbone in temporal networks

An efficient and fast tool to detect the backbone network in temporal networks. For accurate results, it should be applied to networks with at least 1,000 nodes.

The computational time is O(N_E I_{max}^2), where N_E are the number of unique edges in the network and I_{max} the maximum number of intervals. I_{max} can be computed as T (total time steps) divided by the minimum length of the interval, \Delta I_{min}.

For sparse networks (like most of the large networks), the computational time is O(N I_{max}^2)

How to install it

pip install TemporalBackbone

In order to run the library, additional packages should be installed

pip install wget 
wget https://raw.githubusercontent.com/matnado/TemporalBackbone/main/TemporalBackbone/requirements.txt
pip install -r requirements.txt

This implementation assumes that packages like copy, collections, and time are already present, because they cannot be installed via pip install.

How to run the package

import TemporalBackbone as TB

data = TB.Read_sample()
TB.Temporal_Backbone(data)

Input:

  • df pandas dataframe with three columns: node1, node2, time (order is important)
  • I_min minimum length of the interval, written in seconds: default 1 day or 60x60x24 seconds (time step is taken from the data)
  • is_directed whether the network is directed or not: default True
  • Bonferroni whether to use the Bonferroni correction: default True
  • alpha threshold to determine the significance of a link: default 0.01

Output:

  • list with the significant links

Please cite

The methodology is first introduced in Nadini, M., Bongiorno, C., Rizzo, A., & Porfiri, M. (2020). Detecting network backbones against time variations in node properties. Nonlinear Dynamics, 99(1), 855-878.

Then was deemed as appropriate for large temporal networks, having a good trade-off between false positives and false negatives. See Nadini, M., Rizzo, A., & Porfiri, M. (2020). Reconstructing irreducible links in temporal networks: which tool to choose depends on the network size. Journal of Physics: Complexity, 1(1), 015001.

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

TemporalBackbone-0.1.6.tar.gz (3.9 kB view details)

Uploaded Source

Built Distribution

TemporalBackbone-0.1.6-py3-none-any.whl (17.0 kB view details)

Uploaded Python 3

File details

Details for the file TemporalBackbone-0.1.6.tar.gz.

File metadata

  • Download URL: TemporalBackbone-0.1.6.tar.gz
  • Upload date:
  • Size: 3.9 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/3.3.0 pkginfo/1.6.1 requests/2.25.1 setuptools/53.0.0 requests-toolbelt/0.9.1 tqdm/4.55.1 CPython/3.7.9

File hashes

Hashes for TemporalBackbone-0.1.6.tar.gz
Algorithm Hash digest
SHA256 05226cc34929d30f79f93156b6f44e4fe5338568af25a1bc7bd6427f40463dcb
MD5 4a488997a9ec50fb5a2fc60cb39c10f1
BLAKE2b-256 509b8ef4d89b0166e9542bb0696bf115ff0f3bbc0366043459e348ee0eab4baa

See more details on using hashes here.

File details

Details for the file TemporalBackbone-0.1.6-py3-none-any.whl.

File metadata

  • Download URL: TemporalBackbone-0.1.6-py3-none-any.whl
  • Upload date:
  • Size: 17.0 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/3.3.0 pkginfo/1.6.1 requests/2.25.1 setuptools/53.0.0 requests-toolbelt/0.9.1 tqdm/4.55.1 CPython/3.7.9

File hashes

Hashes for TemporalBackbone-0.1.6-py3-none-any.whl
Algorithm Hash digest
SHA256 ab048cd99d046b9ef1c38053a070cc773413d3a2822b4f8b58f69b314afec4e9
MD5 9fadb61152d57a5a62052c31053b25c6
BLAKE2b-256 4ead74cef34e80dd416159f2d8b84ac26dc863da7647c4421f240d23f2b5065d

See more details on using hashes here.

Supported by

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