Showing 1 - 1 of 1
We show that numerical approximations of Kolmogorov complexity (K) of graphs and networks capture some group-theoretic and topological properties of empirical networks, ranging from metabolic to social networks, and of small synthetic networks that we have produced. That K and the size of the...
Persistent link: https://www.econbiz.de/10010931541