Abstract
Since the second half of the last century, the concept of complexity has been studied to find and connect ideas from different disciplines. Several quantifying methods have been proposed, based on computational measures extended to the context of biological and human sciences, as, for instance, the López-Ruiz, Mancini, and Calbet (LMC); and Shiner, Davison, and Landsberg (SDL) complexity measures, which take the concept of information entropy as the core of the definitions. However, these definitions are restricted to discrete probability distributions with finite domains, limiting the systems to be studied. Extensions of these measures were proposed for continuous probability distributions, but discrete distributions with infinite domains were not discussed. Here, these cases are studied and several distributions are analyzed, including the Zipf distribution, considered the paradigmatic model for self-organizing criticality.
Graphic abstract
Similar content being viewed by others
Data Availability Statement
This manuscript has no associated data or the data will not be deposited. [Authors’ comment: Data sharing not applicable to this article as no datasets were generated or analysed during the current study.]
References
E. Morin, On Complexity (Hampton Press, New York, 2008)
M. Anand, L. Orlóci, Complexity in plant communities: the notion of quantification. J. Theor. Biol. 179, 179–186 (1996)
K. Kaneko, I. Tsuda, Complex Systems: chaos and beyond (Springer, Berlin, 2001)
R. Frei, G.M. Serugendo, The future of complexity engineering. Open Eng. 2(2), 123 (2012). https://doi.org/10.2478/s13531-011-0071-0
J.R.C. Piqueira, L.H.A. Monteiro, T.M.C. de Magalhães, R.T. Ramos, R.B. Sassi, E.G. Cruz, Zipf’s law organizes a psychiatric ward. J. Theor. Biol. 198, 439–443 (1999)
L. Von Bertalanffy, General System Theory: Foundations, Development, Applications (George Braziller Inc., New York, 1968)
G. Nicolis, I. Prigogine, Self-Organization in Nonequilibrium Systems (Wiley, New York, 1977)
R. López-Ruiz, H.L. Mancini, X. Calbet, A statistical measure of complexity. Phys. Lett. A 209, 321–326 (1995)
J. Shiner, M. Davison, P. Landsberg, Simple measure for complexity. Phys. Rev. E 59(2), 1459–1464 (1999)
C.E. Shannon, W. Weaver, The Mathematical Theory, of Communication (Illini Books, Urbana, 1963)
R.G. Catalán, R. López-Ruiz, R., Features of the extension of a statistical measure of complexity to continuous systems. Phys. Rev. E 66(1), 011102 (2002). https://doi.org/10.1103/PhysRevE.66.011102
D.P. Feldman, J.P. Crutchfield, Measures of statistical complexity: why? Phys. Lett. Sect. A 238(4), 244–252 (1998)
J.P. Crutchfield, D.P. Feldman, C.R. Shalizi, Comment I on “Simple measure for complexity”. Phys. Rev. E 62, 2996 (2000)
J.R.C. Piqueira, A mathematical view of biological complexity. Commun. Nonlinear Sci. Numer. Simul. 14(6), 2581–2586 (2009)
J.R.C. Piqueira, S.H.V.L. de Mattos, LMC and SDL Complexity Measures: A Tool to Explore Time Series. Complexity 2095063(2019), 1–8 (2019). (Article ID: 2095063)
L.P.D. Mortoza, J.R.C. Piqueira, Measuring complexity in Brazilian economic crises. PLoS ONE 12(3) (2017) (Article ID e0173280)
S. Thurner, R. Hanel, P. Klimek, Introduction to the Theory of Complex Systems (Oxford University Press, Oxford, 2019)
E. Desurvire, Classical and Quantum Information Theory (Cambridge University Press, New York, 2009)
H. Ghourchian, A. Gohari, A. Amini, Existence and continuity of differential entropy for a class of distributions. IEEE Communications Letters 21(7), 1469–1472 (2017)
C. Anteneodo, A. Plastino, Some features of the López-Ruiz-Mancini-Calbet (LMC) statistical measure of complexity. Phys. Lett. A 223(5), 348–354 (1996)
D. Hanselman, B. Littlefield, Mastering MATLAB (Prentice-Hall, New Jersey, 1996)
M. Cheraghchi, Expressions for the entropy of binomial-type distributions. In Proceedings of IEEE International Symposium on Information Theory (ISIT) (2018)
M. Abramowitz, I. Stegun, Handbook of Mathematical Functions (Dover Publications, New York, 2013), p. 377
J.R.C. Piqueira, A comparison of LMC and SDL complexity measures on binomial distributions. Physica A 444, 271–275 (2016)
E.T. Jaynes, Information theory ANS statistical mechanics. Phys. Rev. 106(4), 620–630 (1957)
H. Araky, E.H. Lieb, Entropy inequalities. Commun. Math. Phys. 18, 160–170 (1970)
N.W. Watkins, G. Pruessner, S.C. Chapma, N.B. Crosby, H.J. Jensen, 25 years of self-organized criticality: concepts and controversies. Space Sci. Rev. 198, 3–44 (2016). https://doi.org/10.1007/s11214-015-0155-x
Acknowledgements
JRCP was supported by the Brazilian Research Council (CNPq), Grant number 302883/2018-5.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rizzi, F.A., Piqueira, J.R.C. Complexity measures for probability distributions with infinite domains. Eur. Phys. J. B 94, 62 (2021). https://doi.org/10.1140/epjb/s10051-021-00064-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1140/epjb/s10051-021-00064-4