The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Not all (possibly) “random” sequences are created equal
Open accessAbstract
The need to assess the randomness of a single sequence, especially a finite sequence, is ubiquitous, yet is unaddressed by axiomatic probability theory. Here, we assess randomness via approximate entropy (ApEn), a computable measure of sequential irregularity, applicable to single sequences of both (even very short) finite and infinite length. We indicate the novelty and facility of the multidimensional viewpoint taken by ApEn, in contrast to classical measures. Furthermore and notably, for finite length, finite state sequences, one can identify maximally irregular sequences, and then apply ApEn to quantify the extent to which given sequences differ from maximal irregularity, via a set of deficit (def m ) functions. The utility of these def m functions which we show allows one to considerably refine the notions of probabilistic independence and normality, is featured in several studies, including ( i ) digits of e, π, √2, and √3, both in base 2 and in base 10, and ( ii ) sequences given by fractional parts of multiples of irrationals. We prove companion analytic results, which also feature in a discussion of the role and validity of the almost sure properties from axiomatic probability theory insofar as they apply to specified sequences and sets of sequences (in the physical world). We conclude by relating the present results and perspective to both previous and subsequent studies.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Approximate entropy as a measure of system complexity.
Pincus, S. M. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.6.2297 · Cited by 5,811
Self-citationOn the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1966) · Journal of the ACM · doi:10.1145/321356.321363 · Cited by 913
Cited by
Approximate Entropy and Sample Entropy: A Comprehensive Tutorial
Delgado-Bonal, A., & Marshak, A. (2019) · Entropy · doi:10.3390/e21060541 · Cited by 660
Assessing Serial Irregularity and Its Implications for Health
PINCUS, S. M. (2001) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.2001.tb02755.x · Cited by 401
Self-citationAlterations in the dynamics of circulating ghrelin, adiponectin, and leptin in human obesity
Yildiz, B. O., Suchard, M. A., Wong, M.-L., McCann, S. M., & Licinio, J. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0403465101 · Cited by 385
Licinio, J., Negrão, A. B., Mantzoros, C., Kaklamani, V., Wong, M.-L., Bongiorno, P. B., Mulla, A., Cearnal, L., Veldhuis, J. D., Flier, J. S., et al. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.5.2541 · Cited by 287
McCullagh, P. (2002) · The Annals of Statistics · doi:10.1214/aos/1035844977 · Cited by 248
Metadata
- Authors
- Pincus, S., & Kalman, R. E.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 1997-04-15
- Volume
- 94
- Issue
- 8
- Pages
- 3513-3518
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W1986692269
- Cited by
- 193
- References
- 3
- FWCI
- 17.16
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Not all (possibly) “random” sequences are created equal. https://app.cochat.ai/papers/10.1073/pnas.94.8.3513
- The paper
- Pincus, S., & Kalman, R. E. (1997). Not all (possibly) “random” sequences are created equal. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.94.8.3513
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.