Related papers: The frequency of pattern occurrence in random walk…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…
Order patterns apply well to many fields, because of minimal stationarity assumptions. Here we fix the methodology of patterns of length 3 by introducing an orthogonal system of four pattern contrasts. These contrasts are statistically…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the `quenched' and the `averaged' case.
This paper explores the effectiveness of using ordinal pattern probabilities to evaluate antipersistency in the sign decomposition of long-range anti-correlated Gaussian fluctuations. It is numerically shown that ordinal patterns are able…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
Approaches for mapping time series to networks have become essential tools for dealing with the increasing challenges of characterizing data from complex systems. Among the different algorithms, the recently proposed ordinal networks stand…
Although higher-order interactions are known to affect the typical state of dynamical processes giving rise to new collective behavior, how they drive the emergence of rare events and fluctuations is still an open problem. We investigate…
We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…
Permutation entropy measures the complexity of deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or just permutations. The reasons for the increasing popularity of this entropy in…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
We analyze the ordinal structure of long-range dependent time series. To this end, we use so called ordinal patterns which describe the relative position of consecutive data points. We provide two estimators for the probabilities of ordinal…
A random walk is known as a random process which describes a path including a succession of random steps in the mathematical space. It has increasingly been popular in various disciplines such as mathematics and computer science.…
Order patterns and permutation entropy have become useful tools for studying biomedical, geophysical or climate time series. Here we study day-to-day market data, and Brownian motion which is a good model for their order patterns. A crucial…
Ordinal time series analysis is based on the idea to map time series to ordinal patterns, i.e., order relations between the values of a time series and not the values themselves, as introduced in 2002 by C. Bandt and B. Pompe. Despite a…
A consecutive pattern in a permutation $\pi$ is another permutation $\sigma$ determined by the relative order of a subsequence of contiguous entries of $\pi$. Traditional notions such as descents, runs and peaks can be viewed as particular…
In this paper, we introduce the concept of random time changes in dynamical systems. The sub- ordination principle may be applied to study the long time behavior of the random time systems. We show, under certain assumptions on the class of…
We introduce circulance, a scalar measure for classifying time series of dynamical systems. Circulance captures the extent of temporal regularity or irregularity that is encoded in the topology of a directed ordinal pattern transition…
We introduce a new methodology to analyze the evolution of epidemic time series, which is based on the construction of epidemic networks. First, we translate the time series into ordinal patterns containing information about local…