Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017 (2017), Article ID 3250301, 12 pages
https://doi.org/10.1155/2017/3250301
Research Article

On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy

1Institute of Computing Science, Poznan University of Technology, Piotrowo 2, 60-965 Poznań, Poland
2Department of Computational Intelligence, ENGINE-The European Centre for Data Science, Wrocław University of Science and Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland

Correspondence should be addressed to Mikołaj Morzy; lp.nanzop.tup@yzrom.jalokim

Received 6 April 2017; Revised 27 July 2017; Accepted 13 August 2017; Published 1 November 2017

Academic Editor: Pasquale De Meo

Copyright © 2017 Mikołaj Morzy et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Todd Veldhuizen, “Software libraries and their reuse: Entropy, kolmogorov complexity, and zipf's law,” Library-Centric Software Design (LCSD'05), p. 11, 2005. View at Google Scholar
  2. D. Bonchev and G. A. Buck, “Quantitative measures of network complexity,” in Complexity in chemistry, biology, and ecology, Math. Comput. Chem., pp. 191–235, Springer, New York, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. J. Cardoso, J. Mendling, G. Neumann, and H. A. Reijers, “A discourse on complexity of process models,” in Business Process Management Workshops, vol. 4103 of Lecture Notes in Computer Science, pp. 117–128, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006. View at Publisher · View at Google Scholar
  4. J. Cardoso, “Complexity analysis of BPEL Web processes,” Software Process Improvement and Practice, vol. 12, no. 1, pp. 35–49, 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Latva-Koivisto, 2001, Finding a complexity measure for business process models.
  6. G. M. Constantine, “Graph complexity and the Laplacian matrix in blocked experiments,” Linear and Multilinear Algebra, vol. 28, no. 1-2, pp. 49–56, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. D. L. Neel and M. E. Orrison, “The linear complexity of a graph,” Electronic Journal of Combinatorics, vol. 13, no. 1, Research Paper 9, 19 pages, 2006. View at Google Scholar · View at MathSciNet
  8. J. Kim and T. Wilhelm, “What is a complex graph?” Physica A. Statistical Mechanics and its Applications, vol. 387, no. 11, pp. 2637–2652, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. M. Dehmer, F. Emmert-Streib, Z. Chen, X. Li, and Y. Shi, John Wiley & Sons, Mathematical foundations and applications of graph entropy, 2016.
  10. M. Dehmer and A. Mowshowitz, “A history of graph entropy measures,” Information Sciences. An International Journal, vol. 181, no. 1, pp. 57–78, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. A. Mowshowitz and M. Dehmer, “Entropy and the complexity of graphs revisited,” Entropy. An International and Interdisciplinary Journal of Entropy and Information Studies, vol. 14, no. 3, pp. 559–570, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. S. Cao, M. Dehmer, and Y. Shi, “Extremality of degree-based graph entropies,” Information Sciences. An International Journal, vol. 278, pp. 22–33, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Z. Chen, M. Dehmer, and Y. Shi, “A note on distance-based graph entropies,” Entropy. An International and Interdisciplinary Journal of Entropy and Information Studies, vol. 16, no. 10, pp. 5416–5427, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. K. C. Das and S. Sorgun, “On randic energy of graphs,” MATCH Commun. Math. Comput. Chem, vol. 72, no. 1, pp. 227–238, 2014. View at Google Scholar · View at MathSciNet
  15. I. Gutman and B. Zhou, “Laplacian energy of a graph,” Linear Algebra and its Applications, vol. 414, no. 1, pp. 29–37, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. C. E. Shannon, The Mathematical Theory of Communication, The University of Illinois Press, Urbana, Ill, USA, 1949. View at MathSciNet
  17. A. N. Kolmogorov, “Three approaches to the quantitative definition of information,” International Journal of Computer Mathematics. Section A. Programming Theory and Methods. Section B. Computational Methods, vol. 2, pp. 157–168, 1968. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. A. Rényi et al., “On measures of entropy and information,” in Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, pp. 547–561, University of California Press, 1961. View at Google Scholar · View at MathSciNet
  19. A. Mowshowitz, “Entropy and the complexity of graphs: I. An index of the relative complexity of a graph,” The Bulletin of Mathematical Biophysics, vol. 30, no. 1, pp. 175–204, 1968. View at Publisher · View at Google Scholar · View at Scopus
  20. I. Ji, W. Bing-Hong, W. Wen-Xu, and Z. Tao, “Network entropy based on topology configuration and its computation to random networks,” Chinese Physics Letters, vol. 25, no. 11, p. 4177, 2008. View at Google Scholar
  21. M. Dehmer, “Information processing in complex networks: graph entropy and information functionals,” Applied Mathematics and Computation, vol. 201, no. 1-2, pp. 82–94, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. S. Cao, M. Dehmer, and Z. Kang, “Network entropies based on independent sets and matchings,” Applied Mathematics and Computation, vol. 307, pp. 265–270, 2017. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. J. Körner, “Fredman-komlós bounds and information theory,” SIAM Journal on Algebraic Discrete Methods, vol. 7, no. 4, pp. 560–570, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  24. H. Zenil, N. A. Kiani, and J. Tegnér, “Low-algorithmic-complexity entropy-deceiving graphs,” Physical Review E, vol. 96, no. 1, 2017. View at Publisher · View at Google Scholar
  25. N. Sloane, “The on-line encyclopedia of integer sequences,” https://oeis.org/A033308.
  26. C. Faloutsos and V. Megalooikonomou, “On data mining, compression, and Kolmogorov complexity,” Data Mining and Knowledge Discovery, vol. 15, no. 1, pp. 3–20, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. J. Schmidhuber, “Discovering neural nets with low Kolmogorov complexity and high generalization capability,” Neural Networks, vol. 10, no. 5, pp. 857–873, 1997. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Kulkarni and S. Bush, “Detecting distributed denial-of-service attacks using Kolmogorov Complexity metrics,” Journal of Network and Systems Management, vol. 14, no. 1, pp. 69–80, 2006. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Li and P. M. B. Vitányii, “Kolmogorov complexity and its applications,” in Algorithms and Complexity, Texts and Monographs in Computer Science, pp. 1–187, Springer-Verlag, New York, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  30. G. J. Chaitin, “On the length of programs for computing finite binary sequences,” Journal of the Association for Computing Machinery, vol. 13, pp. 547–569, 1966. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. L. A. Levin, “Laws on the conservation (zero increase) of information, and questions on the foundations of probability theory,” Akademiya Nauk SSSR. Institut Problem Peredachi Informatsii Akademii Nauk SSSR. Problemy Peredachi Informatsii, vol. 10, no. 3, pp. 30–35, 1974. View at Google Scholar · View at MathSciNet
  32. R. J. Solomonoff, “A formal theory of inductive inference. Part I,” Information and Control, vol. 7, no. 1, pp. 1–22, 1964. View at Publisher · View at Google Scholar · View at Scopus
  33. T. Rado, “On non-computable functions,” The Bell System Technical Journal, vol. 41, pp. 877–884, 1962. View at Publisher · View at Google Scholar · View at MathSciNet
  34. F. Soler-Toscano, H. Zenil, J.-P. Delahaye, and N. Gauvrit, “Calculating Kolmogorov complexity from the output frequency distributions of small turing machines,” PLoS ONE, vol. 9, no. 5, Article ID e96223, 2014. View at Publisher · View at Google Scholar · View at Scopus
  35. H. Zenil, F. Soler-Toscano, N. A. Kiani, S. Hernández-Orozco, and A. Rueda-Toicen, A decomposition method for global evaluation of shannon entropy and local estimations of algorithmic complexity, 2016.
  36. D. J. Watts and S. H. Strogatz, “Collective dynamics of "small-world" networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Publisher · View at Google Scholar · View at Scopus
  37. P. Erdös and A. Rényi, “On the evolution of random graphs,” Publications of the Mathematical Institute of the Hungarian Academy of Sciences, vol. 5, pp. 17–61, 1960. View at Google Scholar · View at MathSciNet
  38. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” American Association for the Advancement of Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  39. A.-L. Barabási, “Scale-Free Networks: a Decade and beyond,” American Association for the Advancement of Science. Science, vol. 325, no. 5939, pp. 412-413, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  40. M. E. Newman, “The structure and function of complex networks,” SIAM Review, vol. 45, no. 2, pp. 167–256, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. T. Kajdanowicz and M. Morzy, “Using Kolmogorov Complexity with Graph and Vertex Entropy to Measure Similarity of Empirical Graphs with Theoretical Graph Models,” in Proceedings of the 2nd International Electronic Conference on Entropy and Its Applications, p. C003, Sciforum.net. View at Publisher · View at Google Scholar
  42. N. Gauvrit, H. Singmann, F. Soler-Toscano, and H. Zenil, “Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method,” Behavior Research Methods, vol. 48, no. 1, pp. 314–329, 2016. View at Publisher · View at Google Scholar · View at Scopus
  43. J.-P. Delahaye and H. Zenil, “Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness,” Applied Mathematics and Computation, vol. 219, no. 1, pp. 63–77, 2012. View at Publisher · View at Google Scholar · View at Scopus