Papers › Ordinal pattern probabilities for symmetric random walks
Ordinal pattern probabilities for symmetric random walks
Hugh Denoncourt
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
An ordinal pattern for a finite sequence of real numbers is a permutation that records the relative positions in the sequence. For random walks with steps drawn uniformly from [-1,1], we show an ordinal pattern occurs with probability (|[1,w]|)/(2ⁿ n!), where [1,w] is a weak order interval in the affine Weyl group Aₙ. For random walks with steps drawn from a symmetric Laplace distribution, the probability is 1/(2ⁿ ∏ⱼ₌₁ⁿ lev(π)ⱼ), where lev(π)ⱼ measures how often j occurs between consecutive values in π. Permutations whose consecutive values are at most two positions apart in π are shown to occur with the same probability for any choice of symmetric continuous step distribution. For random walks with steps from a mean zero normal distribution, ordinal pattern probabilities are determined by a matrix whose ij-th entry measures how often i and j are between consecutive values.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections