structural reducibility of multi-layer networks
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
KatolaZ 29cc00c2d4 more efficient costruction of the Laplacian 10 years ago
python more efficient costruction of the Laplacian 10 years ago
README.md Small change in the Readme files 10 years ago

README.md

#multired *

  • Copyright (C) 2015 Vincenzo (Enzo) Nicosia katolaz@yahoo.it
  • This program is free software: you can redistribute it and/or modify
  • it under the terms of the GNU General Public License as published by
  • the Free Software Foundation, either version 3 of the License, or
  • (at your option) any later version.
  • This program is distributed in the hope that it will be useful, but
  • WITHOUT ANY WARRANTY; without even the implied warranty of
  • MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  • General Public License for more details.
  • You should have received a copy of the GNU General Public License
  • long with this program. If not, see http://www.gnu.org/licenses/.

This is multired-0.1.

This is a Python implmementation of the algorithm for structural reduction of multi-layer networks based on the Von Neumann Entropy and on the Quantum Jensen-Shannon divergence of graphs, as explained in:

M. De Domenico. V. Nicosia, A. Arenas, V. Latora "Structural reducibility of multilayer networks", Nat. Commun. 6, 6864 (2015) doi:10.1038/ncomms7864

If you happen to find any use of this code please do not forget to cite that paper ;-)

My plan is to provide also a C version in the future, but I cannot guarantee that I will do so anytime soon.