Distances in probability space and the statistical complexity setup

Mostrar todas las versiones(3)

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 rev...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Kowalski, A.M., Martín, M.T., Plastino, A., Rosso, O.A., Casas, M.
Formato:	JOUR
Materias:	Disequilibrium Generalized statistical complexity Information theory Quantum chaos Selection of the probability distribution Semiclassical theories
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_10994300_v13_n6_p1055_Kowalski
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	todo:paper_10994300_v13_n6_p1055_Kowalski
record_format	dspace
spelling	todo:paper_10994300_v13_n6_p1055_Kowalski2023-10-03T16:06:34Z Distances in probability space and the statistical complexity setup Kowalski, A.M. Martín, M.T. Plastino, A. Rosso, O.A. Casas, M. Disequilibrium Generalized statistical complexity Information theory Quantum chaos Selection of the probability distribution Semiclassical theories 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_10994300_v13_n6_p1055_Kowalski
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Disequilibrium Generalized statistical complexity Information theory Quantum chaos Selection of the probability distribution Semiclassical theories
spellingShingle	Disequilibrium Generalized statistical complexity Information theory Quantum chaos Selection of the probability distribution Semiclassical theories Kowalski, A.M. Martín, M.T. Plastino, A. Rosso, O.A. Casas, M. Distances in probability space and the statistical complexity setup
topic_facet	Disequilibrium Generalized statistical complexity Information theory Quantum chaos Selection of the probability distribution Semiclassical theories
description	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.
format	JOUR
author	Kowalski, A.M. Martín, M.T. Plastino, A. Rosso, O.A. Casas, M.
author_facet	Kowalski, A.M. Martín, M.T. Plastino, A. Rosso, O.A. Casas, M.
author_sort	Kowalski, A.M.
title	Distances in probability space and the statistical complexity setup
title_short	Distances in probability space and the statistical complexity setup
title_full	Distances in probability space and the statistical complexity setup
title_fullStr	Distances in probability space and the statistical complexity setup
title_full_unstemmed	Distances in probability space and the statistical complexity setup
title_sort	distances in probability space and the statistical complexity setup
url	http://hdl.handle.net/20.500.12110/paper_10994300_v13_n6_p1055_Kowalski
work_keys_str_mv	AT kowalskiam distancesinprobabilityspaceandthestatisticalcomplexitysetup AT martinmt distancesinprobabilityspaceandthestatisticalcomplexitysetup AT plastinoa distancesinprobabilityspaceandthestatisticalcomplexitysetup AT rossooa distancesinprobabilityspaceandthestatisticalcomplexitysetup AT casasm distancesinprobabilityspaceandthestatisticalcomplexitysetup
_version_	1782025035253284864

Distances in probability space and the statistical complexity setup

Ejemplares similares