期刊名称：Proceedings of the National Academy of Sciences
印刷版ISSN：0027-8424
电子版ISSN：1091-6490
出版年度：1998
卷号：95
期号：4
页码：1363-1368
DOI：10.1073/pnas.95.4.1363
语种：English
出版社：The National Academy of Sciences of the United States of America
摘要：Although they lie at the conceptual core of a wide range of scientific questions, the notions of irregular or "random" arrangement and the process of randomization itself have never been unambiguously defined. Algorithmic implementation of these concepts requires a combinatorial, rather than a probability-theoretic, formulation. We introduce vector versions of approximate entropy to quantify the degrees of irregularity of planar (and higher dimensional) arrangements. Selection rules, applied to the elements of irregular permutations, define randomization in strictly combinatorial terms. These concepts are developed in the context of Latin square arrangements and valid randomization of them. Conflicts and tradeoffs between the objectives of irregular arrangements and valid randomization are highlighted. Extensions to broad classes of designs, and a diverse range of scientific applications are indicated, including lattice-based models in physics and signal detection in seismology and physiology.
关键词：approximate entropy ; combinatorial ; Latin squares ; lattices
