Journal
EUROPEAN PHYSICAL JOURNAL B
Volume 15, Issue 3, Pages 539-546Publisher
SPRINGER
DOI: 10.1007/s100510051157
Keywords
-
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available