SubgraphEntropy(G,p​rec)

Fast algorithm for computing graph entropy, as calculated from its induced subgraphs.
67 Downloads
Updated Mon, 12 Feb 2018 13:31:44 +0000

View License

This algorithm uses Monte Carlo sampling of the induced subgraphs of a graph to approximate the subgraph entropy of any graph to within any desired precision. The algorithm can handle weighted directed graphs, provided all non-zero weights are non-negative reals. The subgraph entropy is a measure of network complexity which is finer than existing entropies on graphs, such as the von Neumann entropy. The theory behind the subgraph entropy is presented in an upcoming article on the subject, the link to which will be provided here when available.

Cite As

Pierre-Louis Giscard (2024). SubgraphEntropy(G,prec) (https://www.mathworks.com/matlabcentral/fileexchange/66023-subgraphentropy-g-prec), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2017b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Networks in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.0.0.0