Graphlet-based network comparison distances

Supplementary Information for: "Revealing the Hidden Language of Complex Networks"

O. N. Yaveroglu, N. Malod-Dognin, D. Davis, Z. Levnajic, V. Janjic, R. Karapandza, A. Stojmirovic, and N. Przulj

Corresponding author: Prof. Natasa Przulj, e-mail: natasa [AT] cs.ucl.ac.uk
We provide here the python script that we used to compute the various network distances presented in our paper. This includes the Graphlet Correlation Distance (GCD), the Relative Graphlet Frequency Distance (RGF) and the Graphlet Degree Distribution Agreement Distance (GDDA).

• Computing GDV signatures
• Network Comparison script

Usage

• First, all networks must be in Leda (.gw) format.
• Then, you must compute the graphlet degree vector signatures of each network using the provided script:
  "python count.py my_network.gw"
• Finally, to compute GCD-11, all networks and their signature files must be in the same folder:
  "python network_folder gcd11 n", where n is the number of allowed parallel threads

You can check the networkDistance.py script to see all availlable network distance.

E-mail: natasa [at] cs.ucl.ac.uk  |  Office: University College London, Computer Science Department, Gower Street, London WC1E 6BT, UK