On the frequencies of patterns of rises and falls

DOI10.1016/J.PHYSA.2014.04.010MaRDI QIDQ1782889zbMATH OpenOpenAlexFDO

Authors J. M. Luck

Publication date 20 September 2018

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.7764

zbMATH Keywords

permutationsentropypatternsmultifractalsrises and fallsdata series

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Combinatorial probability (60C05)

Abstract: We investigate the probability of observing a given pattern of $n$ rises and falls in a random stationary data series. The data are modelled as a sequence of $n+1$ independent and identically distributed random numbers. This probabilistic approach has a combinatorial equivalent, where the data are modelled by a random permutation on $n+1$ objects. The probability of observing a long pattern of rises and falls decays exponentially with its length $n$ in general. The associated decay rate $alpha$ is interpreted as the embedding entropy of the pattern. This rate is evaluated exactly for all periodic patterns. In the most general case, it is expressed in terms of a determinant of generalized hyperbolic or trigonometric functions. Alternating patterns have the smallest rate $alph{a}_{mmin}=ln(pi/2)=0.451582dots$, while other examples lead to arbitrarily large rates. The probabilities of observing uniformly chosen random patterns are demonstrated to obey multifractal statistics. The typical value $alph{a}_0=0.806361dots$ of the rate plays the role of a Lyapunov exponent. A wide range of examples of patterns, either deterministic or random, is also investigated.

Recommendations

• Joint distribution of rises and falls
• Distribution of the number of words with a prescribed frequency and tests of randomness
• The frequency of pattern occurrence in random walks
• Order Patterns in Time Series
• PATTERN DEFINITION AND INFERENCE WITH STOCHASTIC PROCESSES

Cites work

• scientific article; zbMATH DE number 5729471 (Why is no real title available?)
• scientific article; zbMATH DE number 192842 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 1912121 (Why is no real title available?)
• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• scientific article; zbMATH DE number 3233639 (Why is no real title available?)
• scientific article; zbMATH DE number 3263280 (Why is no real title available?)
• scientific article; zbMATH DE number 3322983 (Why is no real title available?)
• A new operation on sequences: The boustrophedon transform
• A note on permutations with fixed pattern
• Asymptotics of permutations with nearly periodic patterns of rises and falls
• Counting and Generating Permutations Using Timed Languages
• Enumerating pairs of permutations with the same up-down form
• Enumeration of permutations with prescribed up-down and inversion sequences
• Enumeration of rises and falls by position
• Exact solutions for the statistics of extrema of some random 1D landscapes, application to the equilibrium and the dynamics of the toy model
• Generalized Euler Number Sequences: Asymptotic Estimates and Congruences
• Generating permutations with given ups and downs
• Level-spacing distributions and the Airy kernel
• On arithmetic and asymptotic properties of up-down numbers
• On orthogonal and symplectic matrix ensembles
• On the top eigenvalue of heavy-tailed random matrices
• On zigzag permutations and comparisons of adjacent elements
• Patterns in permutations and words.
• Permutations ayant une forme donnée
• Permutations with prescribed pattern
• Some Properties of Generalized Euler Numbers
• Some arithmetic properties of the Olivier functions
• Substitution dynamical systems - spectral analysis
• The number of permutations with a given signature, and the expectations of their elements

Cited in

(4)

• Dynamic space packing
• Poisson points, resetting, universality and the role of the last item
• Counting and generating permutations in regular classes
• Young tableaux with periodic walls: counting with the density method

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On the frequencies of patterns of rises and falls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1782889)