Skip to content
Preprint

Unveiling Amplitude Distributions via the Ordinal Language of Random Walks

Jul 2026 · 0 citations · 43 references
Physics

Abstract

Ordinal patterns are widely used to characterize temporal organization in time series, yet they are often considered insensitive to the amplitude distribution of the data. In this work, we show that this limitation can be overcome by considering the ordinal structure of integrated time series. We investigate random walks generated from independent non-Gaussian increments and derive analytical expressions for the ordinal pattern probabilities associated with them. We show that for symmetric distributions, the probabilities of some ordinal patterns are fully determined by symmetry arguments, while those for the remaining patterns depend explicitly on the shape of the increments distribution. Numerical simulations based on $q$-Gaussian increments validate the theoretical predictions. We further show that the construction of the random walk itself plays a fundamental role in the accurate characterization of non-Gaussian fluctuations, as different centering procedures may significantly affect the resulting ordinal statistics. Finally, we validate the proposed framework using financial time series, showing that the ordinal distributions of integrated logarithmic returns capture non-Gaussian features consistent with a cubic law.

View source

Similar papers

Preprint Aug 2026

Noise Effects on Ordinal Pattern Statistics via Majorization

The Bandt-Pompe permutation entropy framework, alongside the complexity-entropy causality plane, has become a standard tool for characterizing the dynamical properties of time series. However, observational noise distorts ordinal pattern probability distributions in ways that can systematically misplace time series wit...

Facundo Sapienza · 0 citations
#machine learning Preprint Oct 2026

Sample complexity bounds for categorical Markov random fields via Discrete Diffusions

Many applications in statistics, economics, and physics require sampling from high-dimensional categorical distributions with local dependence structures. Examples include finite memory language models, Ising and Potts systems in statistical physics and protein folding, etc. In modern machine learning, discrete diffusi...

Shivam Kumar, Nabarun Deb · 0 citations
Open access Sep 2026

Lie-derivative organizers of ordinal-pattern regimes in chaotic systems.

Classical ordinal-pattern methods quantify complexity from a scalar time series without requiring a model, but they are usually reported as global statistics and say little about where along a chaotic trajectory ordinal regimes change. For a smooth flow x˙=F(x) observed through a scalar ϕ(x), we define the first two ma...

M. Sanchis-Agudo · 0 citations
Preprint Aug 2026

Beyond Zipf's Law: Equifinality and Mechanistic Inference from Scaling Laws

Scaling laws summarize complex systems through low-dimensional regularities, but the same marginal law can arise from different stochastic dynamics. We examine this ambiguity for Zipf rank--frequency scaling. An i.i.d. finite-Zipf process, a persistent Markov chain, and canonical sample-space reduction (SSR) are constr...

Arthur Charpentier · 0 citations
Preprint Sep 2026

Recovery Random Walks and Extreme Events on Complex Networks

Extreme events are widely studied within simple random walk frameworks, where their probability is determined by the network structure and stationary walker distribution. Here, we propose a recovery random walk (RRW) model in which extreme events temporally `freeze'the nodes where they occur for a fixed duration $\Delt...

Karan Singh, V. NarendranR, V. K. Chandrasekar et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.