Asymptotic distribution of the statistical complexity under the multinomial law

Andrea Rey, Alejandro C. Frery and Juliana Gambini

Chaos, Solitons & Fractals, 2025, vol. 193, issue C

Abstract: The Statistical Complexity is a feature computed from a probability function that aims to quantify the structure of the system that produced the observations. It is the product between the normalized Shannon Entropy and the normalized Jensen–Shannon distance between the probability function and the uniform law. We obtain the Statistical Complexity asymptotic distribution under the Multinomial model, and we validate this result with numerical experiments. We present examples where this asymptotic result provides a good approximation, even in scenarios where the Multinomial model is not strictly valid, such as in applications to Bandt and Pompe ordinal patterns. We provide the R code that implements these functions.

Keywords: Statistical complexity; Asymptotic distribution; Multinomial distribution (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077925000980
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:193:y:2025:i:c:s0960077925000980

DOI: 10.1016/j.chaos.2025.116085

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().