Skip to main content

GDynaDist: an embedding-based distance for temporal graphs

Project description

G-DynaDist

Dall'Amico, Barrat, Cattuto - An embedding-based distance for temporal graphs

| Documentation | Paper |

pip install gdynadist

Summary

These codes implement our definition of distance between temporal graphs as defined in Dall'Amico, Cattuto, Barrat An embedding-based distance for temporal graphs. We consider the problem of comparing pairs of temporal graphs, i.e relational datasets in which the interaction between node pairs $i, j$ are time-stamped.

We define two metrics for matched and unmatched graphs, respectively. We say two graphs are matched if there exists a known bijective relationship between the nodes of the two graphs and they unmatched otherwise. Matched graphs have the same number of nodes and represent different instances of the same graph, while unmatched graphs may have a different number of nodes.

To compute the distance, we first obtain a node embedding of the temporal graphs, and then we compute the distances in the embedded space. The embedding is obtained using the EDRep Python package. The figure below summarizes the pipeline adopted to compute the distance.

Citation

If you make use of these codes, please reference the following articles

@article{dallamico2024embeddingbased,
   title={An embedding-based distance for temporal graphs},
   volume={15},
   ISSN={2041-1723},
   url={http://dx.doi.org/10.1038/s41467-024-54280-4},
   DOI={10.1038/s41467-024-54280-4},
   number={1},
   journal={Nature Communications},
   publisher={Springer Science and Business Media LLC},
   author={Dall’Amico, Lorenzo and Barrat, Alain and Cattuto, Ciro},
   year={2024},
   month=nov }
@article{
dallamico2025learning,
title={Learning distributed representations with efficient SoftMax normalization},
author={Lorenzo Dall'Amico and Enrico Maria Belliardo},
journal={Transactions on Machine Learning Research},
issn={2835-8856},
year={2025},
url={https://openreview.net/forum?id=9M4NKMZOPu},
note={}
}

Author

Lorenzo Dall'Amico - lorenzo.dallamico@isi.it

Licence

This software is released under the GNU AFFERO GENERAL PUBLIC LICENSE (see included file LICENSE)

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

gdynadist-0.1.1.tar.gz (19.2 kB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

gdynadist-0.1.1-py3-none-any.whl (18.2 kB view details)

Uploaded Python 3

File details

Details for the file gdynadist-0.1.1.tar.gz.

File metadata

  • Download URL: gdynadist-0.1.1.tar.gz
  • Upload date:
  • Size: 19.2 kB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.1.0 CPython/3.12.7

File hashes

Hashes for gdynadist-0.1.1.tar.gz
Algorithm Hash digest
SHA256 1036071808f9d5feea6c314235c887e2ad1ec633b6a21078b4f12df2201f143b
MD5 2611363c64c7f3d02f582ddd739c1a11
BLAKE2b-256 de4f0b5fca7b08ca343993100045e16e69c3ac3c1abf1ef9fd333ff703a8c528

See more details on using hashes here.

File details

Details for the file gdynadist-0.1.1-py3-none-any.whl.

File metadata

  • Download URL: gdynadist-0.1.1-py3-none-any.whl
  • Upload date:
  • Size: 18.2 kB
  • Tags: Python 3
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.1.0 CPython/3.12.7

File hashes

Hashes for gdynadist-0.1.1-py3-none-any.whl
Algorithm Hash digest
SHA256 516fb06f6df8be479a1e471b784af26588cb008a059ae282750e2d78ec69d69e
MD5 93cd9bd803ed071601cee66b0c8a8605
BLAKE2b-256 5ccb66336f3256c32aec6784b59653789ab367ec82ff000722d08b35fad94132

See more details on using hashes here.

Supported by

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