Related papers: A Probabilistic Approach to Generalized Zeckendorf…
We establish a coboundary condition for a sequence of ergodic sums (i.e.~Birkhoff partial sums) to be almost surely uniformly distributed mod $1$. Applications are given when the sequence is generated by a Gibbs-Markov map. In particular,…
We explore a generalization of the Markov numbers that is motivated by a specific generalized cluster algebra arising from an orbifold, in the sense of Chekhov and Shapiro. We give an explicit algorithm for computing these generalized…
The generalized recurrence plot is a modern tool for quantification of complex spatial patterns. Its application spans the analysis of trabecular bone structures, Turing patterns, turbulent spatial plankton patterns, and fractals.…
In probability theory, the Chernoff bound gives exponentially decreasing bounds on tail distributions for sums of independent random variables and such bound is applied at different fields in science and engineering. In this work, we…
We show how generalized Gibbs-Shannon entropies can provide new insights on the statistical properties of texts. The universal distribution of word frequencies (Zipf's law) implies that the generalized entropies, computed at the word level,…
This paper establishes complete convergence for weighted sums and the Marcinkiewicz--Zygmund-type strong law of large numbers for sequences of negatively associated and identically distributed random variables $\{X,X_n,n\ge1\}$ with general…
We provide a unified framework to compute the stationary distribution of any finite irreducible Markov chain or equivalently of any irreducible random walk on a finite semigroup $S$. Our methods use geometric finite semigroup theory via the…
We introduce here a general framework for studying continued fraction expansions for complex numbers and establish some results on the convergence of the corresponding sequence of convergents. For continued fraction expansions with partial…
We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…
Generalized sampling is a recently developed linear framework for sampling and reconstruction in separable Hilbert spaces. It allows one to recover any element in any finite-dimensional subspace given finitely many of its samples with…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
Hilberg's conjecture about natural language states that the mutual information between two adjacent long blocks of text grows like a power of the block length. The exponent in this statement can be upper bounded using the pointwise mutual…
A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…
The spectral gap of a Markov chain can be bounded by the spectral gaps of constituent "restriction" chains and a "projection" chain, and the strength of such a bound is the content of various decomposition theorems. In this paper, we…
The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…
We introduce the concept of Minkowski normality, a different type of normality for the regular continued fraction expansion. We use the ordering \[ \frac{1}{2},\quad \frac{1}{3}, \frac{2}{3},\quad \frac{1}{4}, \frac{3}{4},\frac{2}{5},…
Finite-state dimension quantifies the asymptotic rate of information in an infinite sequence as perceived by finite automata. For a fixed alphabet, the infinite sequences that have maximal finite-state dimension are exactly those that are…
In the base phi expansion any natural number is written uniquely as a sum of powers of the golden mean with coefficients 0 and 1, where it is required that the product of two consecutive digits is always 0. We tackle the problem of…
We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the $n^{\mathrm{th}}$ word is uniformly distributed over the set of words of length $2n$ in which $n$ letters are $a$ and $n$ letters…
We present a common ground for infinite sums, unordered sums, Riemann/Lebesgue integrals, arc length and some generalized means. It is based on extending functions on finite sets using Hausdorff metric in a natural way.