You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Irregular Arrays and Randomization
Burton H. Singer and Steve Pincus
Proceedings of the National Academy of Sciences of the United States of America
Vol. 95, No. 4 (Feb. 17, 1998), pp. 1363-1368
Published by: National Academy of Sciences
Stable URL: http://www.jstor.org/stable/44288
Page Count: 6
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
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.
Proceedings of the National Academy of Sciences of the United States of America © 1998 National Academy of Sciences