Universality of algorithms predicting strong events in complex systems
Informacionnye tehnologii i vyčislitelnye sistemy, no. 1 (2011), pp. 24-34
Voir la notice de l'article provenant de la source Math-Net.Ru
In spite of hypothesis claiming non-predictability of models with self-organized criticality (SOC), this paper for the first time gives evidence that strong events in a SOC-model of earthquake occurrence (of the Manna type) are predictable with certain efficiency. Some quiescence underlies the prediction. The error diagram exhibits prediction efficiency.
Keywords:
self-organized criticality, prediction, error diagram.
@article{ITVS_2011_1_a3,
author = {A. B. Shapoval and M. G. Shnirman},
title = {Universality of algorithms predicting strong events in complex systems},
journal = {Informacionnye tehnologii i vy\v{c}islitelnye sistemy},
pages = {24--34},
publisher = {mathdoc},
number = {1},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ITVS_2011_1_a3/}
}
TY - JOUR AU - A. B. Shapoval AU - M. G. Shnirman TI - Universality of algorithms predicting strong events in complex systems JO - Informacionnye tehnologii i vyčislitelnye sistemy PY - 2011 SP - 24 EP - 34 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ITVS_2011_1_a3/ LA - ru ID - ITVS_2011_1_a3 ER -
A. B. Shapoval; M. G. Shnirman. Universality of algorithms predicting strong events in complex systems. Informacionnye tehnologii i vyčislitelnye sistemy, no. 1 (2011), pp. 24-34. http://geodesic.mathdoc.fr/item/ITVS_2011_1_a3/