Distances in probability space and the statistical complexity setup

46Citations
Citations of this article
55Readers
Mendeley users who have this article in their library.

Abstract

Statistical complexity measures (SCM) are the composition of two ingredients: (i) entropies and (ii) distances in probability-space. In consequence, SCMs provide a simultaneous quantification of the randomness and the correlational structures present in the system under study. We address in this review important topics underlying the SCM structure, viz., (a) a good choice of probability metric space and (b) how to assess the best distance-choice, which in this context is called a "disequilibrium" and is denoted with the letter Q. Q, indeed the crucial SCM ingredient, is cast in terms of an associated distance D. Since out input data consists of time-series, we also discuss the best way of extracting from the time series a probability distribution P. As an illustration, we show just how these issues affect the description of the classical limit of quantum mechanics. © 2011 by the authors; licensee MDPI, Basel, Switzerland.

Cite

CITATION STYLE

APA

Kowalski, A. M., Martín, M. T., Plastino, A., Rosso, O. A., & Casas, M. (2011). Distances in probability space and the statistical complexity setup. Entropy, 13(6), 1055–1075. https://doi.org/10.3390/e13061055

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free