SubgraphEntropy(G,prec)
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
Platform Compatibility
Windows macOS LinuxTags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |