An approach to the physics of complexity
On the basic representation of complex systems by probabilistic weighted, connected directed acyclic graphs the author discusses Zipf's law and the possibility of obtaining the critical complexities for the evolution of complex systems. The speculation for the critical complexity per feature in respect to the chance to preserve the minimal hierarchical structure of the complex system gives \(C_ 0 = 2^{-1} \ln 2 \pi e^ 2 \sim 2,77\) bit per feature. An exact analytic treatment later gives the value \(C_ 0 = \pi^ 2/(6 \ln 2) \sim 2,37\) bit per feature.
probabilistic weighted, connected directed acyclic graphs
scientific article; zbMATH DE number 558834