Permutation entropy and statistical complexity in graph-based representations across world languages

Urbina-Parada F.; Vera J. · EPL (2026) · DOI: 10.1209/0295-5075/ae397f

Resumen

We present a complexity-entropy analysis of word co-occurrence networks built from a parallel corpus of 360 languages spanning diverse typological and geographical groups. Each network represents words as nodes and bigram relations as edges. To capture structural organization, we measure permutation entropy and statistical complexity using the Bandt-Pompe ordinal pattern method, and lexical entropy using the Nemenman-Shafee-Bialek estimator. Language networks cluster in a compact region of the complexity-entropy plane, with consistently low values, clearly distinct from randomized Erdős-Rényi baselines. A negative correlation emerges between lexical and permutation entropy: greater vocabulary diversity tends to coincide with more ordered, less random token sequences. This shift suggests that languages expand their lexical space while reinforcing sequential structure. Family-level comparisons highlight systematic differences: Quechuan and Turkic languages combine high lexical entropy with low permutation entropy, Mayan languages show the reverse pattern, and Panoan and Tupian occupy intermediate positions. These results reveal a robust trade-off between lexical diversity and ordinal structure that supports efficient communication. Copyright

Instituciones: Universidad Tecnológica del Perú