The DOI matches its Crossref record; 124 of the 124 references it cites were found in a registry or an index.
Predictability: a way to characterize complexity
Open accessAbstract
Abstract Different aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov–Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize how a characterization of the unpredictability of a system gives a measure of its complexity. Adopting this point of view, we review some developments in the characterization of the predictability of systems showing different kinds of complexity: from low-dimensional systems to high-dimensional ones with spatio-temporal chaos and to fully developed turbulence. A special attention is devoted to finite-time and finite-resolution effects on predictability, which can be accounted with suitable generalization of the standard indicators. The problems involved in systems with intrinsic randomness is discussed, with emphasis on the important problems of distinguishing chaos from noise and of modeling the system. The characterization of irregular behavior in systems with discrete phase space is also considered.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Deterministic Nonperiodic Flow
Lorenz, E. N. (1963) · Journal of the Atmospheric Sciences · doi:10.1175/1520-0469(1963)020<0130:dnf>2.0.co;2 · Cited by 19,398
Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields
Guckenheimer, J., & Holmes, P. (1983) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-1140-2 · Cited by 16,144
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,000
Savitzky-Golay Smoothing Filters
Press, W. H., & Teukolsky, S. A. (1990) · Computers in Physics · doi:10.1063/1.4822961 · Cited by 11,670
Detecting strange attractors in turbulence
Takens, F. (1981) · Lecture Notes in Mathematics · doi:10.1007/bfb0091924 · Cited by 10,459 · cited 2×
“In such a case, one considers vectors (u(t); u(t+ ); : : : ; u(t+m − )), that live in Rm and allow a reconstruction of the original phase space, known as delay embedding in the literature [209,199] (see also [1,2,114,170]), and it is a special case of (3.”
BackgroundDetermining Lyapunov exponents from a time series
Wolf, A., Swift, J. B., Swinney, H. L., & Vastano, J. A. (1985) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(85)90011-9 · Cited by 9,499
Stochastic Problems in Physics and Astronomy
Chandrasekhar, S. (1943) · Reviews of Modern Physics · doi:10.1103/revmodphys.15.1 · Cited by 8,470
Pattern formation outside of equilibrium
Cross, M. C., & Hohenberg, P. C. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.851 · Cited by 7,859
Cited by
The ecological forecast horizon, and examples of its uses and determinants
Petchey, O. L., Pontarp, M., Massie, T. M., Kéfi, S., Ozgul, A., Weilenmann, M., Palamara, G. M., Altermatt, F., Matthews, B., Levine, J. M., et al. (2015) · Ecology Letters · doi:10.1111/ele.12443 · Cited by 348
An information-theoretic primer on complexity, self-organization, and emergence
Prokopenko, M., Boschetti, F., & Ryan, A. J. (2009) · Complexity · doi:10.1002/cplx.20249 · Cited by 251
Metadata
- Authors
- Boffetta, G.
- Venue
- Physics Reports
- Publisher
- Elsevier BV
- Published
- 2002-01
- Volume
- 356
- Issue
- 6
- Pages
- 367-474
- ISSN
- 0370-1573 (ISSN-L)
- OpenAlex
- W2164454345
- Cited by
- 391
- References
- 124
- FWCI
- 28.44
- 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: Predictability: a way to characterize complexity. https://app.cochat.ai/papers/10.1016/s0370-1573(01)00025-4
- The paper
- Boffetta, G. (2002). Predictability: a way to characterize complexity. Physics Reports. https://doi.org/10.1016/s0370-1573(01)00025-4
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.
