Complexity of two-dimensional patterns

  • Yu.A. Andrienko
  • N.V. Brilliantov
  • J. Kurths
Article

DOI: 10.1007/s100510051157

Cite this article as:
Andrienko, Y., Brilliantov, N. & Kurths, J. Eur. Phys. J. B (2000) 15: 539. doi:10.1007/s100510051157

Abstract:

To describe quantitatively the complexity of two-dimensional patterns we introduce a complexity measure based on a mean information gain. Two types of patterns are studied: geometric ornaments and patterns arising in random sequential adsorption of discs on a plane (RSA). For the geometric ornaments analytical expressions for entropy and complexity measures are presented, while for the RSA patterns these are calculated numerically. We compare the information-gain complexity measure with some alternative measures and show advantages of the former one, as applied to two-dimensional structures. Namely, this does not require knowledge of the “maximal” entropy of the pattern, and at the same time sensitively accounts for the inherent correlations in the system.

PACS. 05.20.-y Classical statistical mechanics - 05.90.+m Other topics in statistical physics, thermodynamics, and nonlinear dynamical systems 

Copyright information

© EDP Sciences, Springer-Verlag, Società Italiana di Fisica 2000

Authors and Affiliations

  • Yu.A. Andrienko
    • 1
  • N.V. Brilliantov
    • 1
  • J. Kurths
    • 2
  1. 1.Physics DepartmentMoscow State UniversityMoscowRussia
  2. 2.Physics DepartmentUniversity Potsdam,Am Neuen PalaisPotsdamGermany

Personalised recommendations