Related papers: Random Lochs' Theorem
Expansions that furnish increasingly good approximations to real numbers are usually related to dynamical systems. Although comparing dynamical systems seems difficult in general, Lochs was able in 1964 to relate the relative speed of…
We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aimed to compare the efficiency by describing the rate at which the…
Lochs' theorem and its generalizations are conversion theorems that relate the number of digits determined in one expansion of a real number as a function of the number of digits given in some other expansion. In its original version,…
This article provides a brief overview on a range of basic dynamical systems that conform to the logarithmic distribution of significant digits known as Benford's law. As presented here, most theorems are special cases of known, more…
The uneven distribution of digits in numerical data, known as Benford's law, was discovered in 1881. Since then, this law has been shown to be correct in copious numerical data relating to economics, physics and even prime numbers. Although…
We present a general approach to establish the Central Limit Theorem with error bounds for sequential dynamical systems. The main tool we develop is the application to this setting of a projective metric on complex cones, following the…
The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…
We develop a new toolbox for the analysis of the global behavior of stochastic discrete particle systems. We introduce and study the notion of the Schur generating function of a random discrete configuration. Our main result provides a…
We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…
We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…
In 1970, Donald Ornstein proved a landmark result in dynamical systems, viz., two Bernoulli systems with the same entropy are isomorphic except for a measure 0 set. Keane and Smorodinsky gave a finitary proof of this result. They also…
The principle of entropy increase is not only the basis of statistical mechanics, but also closely related to the irreversibility of time, the origin of life, chaos and turbulence. In this paper, we first discuss the dynamic system…
We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on $n$ integers. Under certain…
Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…
We consider the continued fraction digits as random variables measured with respect to Lebesgue measure. The logarithmically scaled and normalized fluctuation process of the digit sums converges strongly distributional to a random variable…
Limit theorems for a linear dynamical system with random interactions are established. These theorems enable us to characterize the dynamics of a large complex system in details and assess whether a large complex system is stable or…
In this paper we consider the stochastic six-vertex model on a cylinder with arbitrary initial data. First, we show that it exhibits a limit shape in the thermodynamic limit, whose density profile is given by the entropy solution to an…
We propose that chaotic Glass networks (a class of piecewise-linear Ordinary Differential Equations) are good candidates for the design of true random number generators. A Glass network design has the advantage of involving only standard…
Given a stochastic process $\{A_n, n \geq 1\}$ taking values in natural numbers, the random continued fractions is defined as $[A_1, A_2, \cdots, A_n, \cdots]$ analogue to the continued fraction expansion of real numbers. Assume that…
In classical probability theory, the convergence of empirical frequencies to theoretical probabilities: as captured by the Law of Large Numbers (LLN): is treated as axiomatic and emergent from statistical assumptions such as independence…