The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Features of the extension of a statistical measure of complexity to continuous systems
Open accessAbstract
We discuss some aspects of the extension to continuous systems of a statistical measure of complexity introduced by López-Ruiz, Mancini, and Calbet [Phys. Lett. A 209, 321 (1995)]. In general, the extension of a magnitude from the discrete to the continuous case is not a trivial process and requires some kind of choice. In the present study, several possibilities appear available. One of them is examined in detail. Some interesting properties desirable for any magnitude of complexity are discovered on this particular extension.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
On the Complexity of Finite Sequences
Lempel, A., & Ziv, J. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055501 · Cited by 2,717
Wehrl, A. (1978) · Reviews of Modern Physics · doi:10.1103/revmodphys.50.221 · Cited by 1,963
Mathematical Foundations of Information Theory.
Snell, J. L., Khinchin, A. I., Silverman, R. A., & Friedman, M. D. (1959) · The American Mathematical Monthly · doi:10.2307/2310044 · Cited by 1,451
The role of constraints within generalized nonextensive statistics
Tsallis, C., Mendes, R., & Plastino, A. R. (1998) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(98)00437-3 · Cited by 1,430
Inferring statistical complexity
Crutchfield, J. P., & Young, K. (1989) · Physical Review Letters · doi:10.1103/physrevlett.63.105 · Cited by 1,002
1 A Statistical Measure of ComplexityPreprint
López‐Ruiz, R., Mancini, H., & Calbet, X. (1995) · Cited by 939
Self-citationA Statistical Measure of Complexity
López-Ruiz, R., Mancini, H. L., & Calbet, X. (1995) · Physics Letters A · doi:10.1016/0375-9601(95)00867-5 · Cited by 920
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
Toward a quantitative theory of self-generated complexity
Grassberger, P. (1986) · International Journal of Theoretical Physics · doi:10.1007/bf00668821 · Cited by 694
Complexity as thermodynamic depth
Lloyd, S., & Pagels, H. (1988) · Annals of Physics · doi:10.1016/0003-4916(88)90094-2 · Cited by 517
Measures of statistical complexity: Why?
Feldman, D. P., & Crutchfield, J. P. (1998) · Physics Letters A · doi:10.1016/s0375-9601(97)00855-4 · Cited by 436
Shiner, J. S., Davison, M., & Landsberg, P. T. (1999) · Physical Review E · doi:10.1103/physreve.59.1459 · Cited by 317
Tendency towards maximum complexity in a nonequilibrium isolated system
Calbet, X., & López-Ruiz, R. (2001) · Physical Review E · doi:10.1103/physreve.63.066116 · Cited by 182
Self-citationHuberman, B. A., & Hogg, T. (1986) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(86)90308-1 · Cited by 173
Physical complexity of symbolic sequences
Adami, C., & Cerf, N. J. (2000) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(99)00179-7 · Cited by 156
Metadata
- Authors
- Catalán, R. G., Garay, J., & López-Ruiz, R.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2002-07-15
- Volume
- 66
- Issue
- 1
- Pages
- 011102-011102
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1977061696
- Cited by
- 262
- References
- 16
- FWCI
- 1.04
- 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
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.