SubgraphEntropy(G,p​rec)

Fast algorithm for computing graph entropy, as calculated from its induced subgraphs.

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.