Renewal Model for Dependent Binary Sequences
نویسندگان
چکیده
We suggest to construct infinite stochastic binary sequences by associating one of the two symbols sequence with renewal times an underlying process. Focusing on stationary corresponding delayed processes, we investigate correlations and ability model implement a prescribed autocovariance structure, showing that large variety subexponential decay can be accounted for. In particular, robustness efficiency method are tested generating polynomial stretched-exponential correlations. Moreover, justify maximum entropy principle for selection, asymptotic equipartition property typical naturally leads Shannon waiting time distribution is demonstrated. To support comparison theory data, law numbers central limit theorem established average general observables.
منابع مشابه
Renewal Theorem for a Class of Stationary Sequences
A renewal theorem is obtained for stationary sequences of the form ~,=~( . . . , Xn_ ~, X,, X,+I , ...), where X,, n~Z, are i.i.d.r.v.s, valued in a Polish space. This class of processes is sufficiently broad to encompass functionals of recurrent Markov chains, functionals of stationary Gaussian processes, and functionals of one-dimensional Gibbs states. The theorem is proved by a new coupling ...
متن کاملIsoperimetric Sequences for Infinite Complete Binary Trees, Meta-Fibonacci Sequences and Signed Almost Binary Partitions
In this paper we demonstrate connections between three seemingly unrelated concepts. 1. The discrete isoperimetric problem in the infinite binary tree with all the leaves at the same level, T∞: The n-th edge isoperimetric number δ(n) is defined to be min|S|=n,S⊂V (T∞) |(S, S)|, where (S, S) is the set of edges in the cut defined by S. 2. Signed almost binary partitions: This is the special case...
متن کاملBinary Periodic Synchronizing Sequences
In this article, we consider words over f0; 1g of length l 2. The autodistance of such a word is the lowest among the Hamming distances between the word and its images by circular permutations other than identity; the word’s reverse autodistance is the highest among these distances. For each l 2, we study the words of length l whose autodistance and reverse autodistance are close to l=2 (we cal...
متن کاملBinary Prime Tableau Sequences
This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. The PT sequence of rank p is obtained from numbers arranged in a tableau with p columns where primes are marked off until each column has at least one prime and where the column entries are added modulo 2. We also examine the dual t...
متن کاملBinary Random Sequences Obtained From Decimal Sequences
D sequences [1-15] are perhaps the simplest family of random sequences that subsumes other families such as shift register sequences [16]. In their ordinary form, d sequences are not computationally complex [2], but they can be used in a recursive form [8] that is much stronger from a complexity point of view. The basic method of the generating the binary d-sequences is given in [1]. The autoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2022
ISSN: ['0022-4715', '1572-9613']
DOI: https://doi.org/10.1007/s10955-022-02893-8