Related papers: A note on the run length function for intermittenc…
For $x\in [0,1],$ the run-length function $r_n(x)$ is defined as the length of the longest run of $1$'s amongst the first $n$ dyadic digits in the dyadic expansion of $x.$ Erd\H{o}s and R\'enyi proved that…
The Erd\H os-R\'enyi law states that given a sequence $\{X_j\}_{j=1}^\infty$ of i.i.d.~($p$) coin-tosses, the longest run $L_n$ of heads in the first $n$ coin tosses approaches $\log_{1/p}n$ almost surely. In this paper we explore a…
Our objective is to provide an upper bound for the length $\ell_N$ of the longest run of consecutive integers smaller than $N$ which have the same number of divisors. We prove in an elementary way that $\log\ell_N\ll(\log N\log\log…
We study the ergodic and statistical properties of a class of maps of the circle and of the interval of Lorenz type which present indifferent fixed points and points with unbounded derivative. These maps have been previously investigated in…
We give an example of a sequential dynamical system consisting of intermittent-type maps which exhibits loss of memory with a polynomial rate of decay. A uniform bound holds for the upper rate of memory loss. The maps may be chosen in any…
We consider intermittent maps T of the interval, with an absolutely continuous invariant probability measure \mu. Kim showed that there exists a sequence of intervals A_n such that \sum \mu(A_n)=\infty, but \{A_n\} does not satisfy the…
We derive new variants of the quantitative Borel--Cantelli lemma and apply them to analysis of statistical properties for some dynamical systems. We consider intermittent maps of $(0,1]$ which have absolutely continuous invariant…
We investigate ergodic-theoretical quantities and large deviation properties of one-dimensional intermittent maps, that have not only an indifferent fixed point but also a singular structure such that the uniform measure is invariant under…
Let $\mathbf{A}=\{A_i\}_{i=1}^{\infty}$ be a sequence of sets with each $A_i$ being a non-empty collection of $0$-$1$ sequences of length $i$. For $x\in [0,1)$, the maximal run-length function $\ell_n(x,\mathbf{A})$ (with respect to…
Consider an inhomogeneous Poisson process and let $D$ be the first of its epochs which is followed by a gap of size $\ell>0$. We establish a criterion for $D<\infty$ a.s., as well as for $D$ being long-tailed and short-tailed, and obtain…
This note examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive…
Given a base $b$, a "digit map" is a map $f: \mathbb{Z}^{\ge 0} \to \mathbb{Z}^{\ge 0}$ of the form $f(\sum_{i=0}^n a_ib^i) = \sum_{i=0}^n f_*(a_i)$, $0 \le a_i \le b-1$ for each $i$, where $f_* : \{0,1,\dots, b-1\} \to \mathbb{Z}^{\ge 0}$…
We study circuit codes with long bit runs (sequences of distinct transitions) and derive a formula for the maximum length for an infinite class of symmetric circuit codes with long bit runs. This formula also results in an improved lower…
For each integer $\ell \geq 4$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $\ell$ and even
In this note, we studied the asymptotic behaviour of the length of the longest common substring for run-length encoded sequences. When the original sequences are generated by an $\alpha$-mixing process with exponential decay (or…
We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…
We study nonstationary dynamical systems formed by sequential concatenation of nonuniformly expanding maps with a uniformly expanding first return map. Assuming a polynomially decaying upper bound on the tails of first return times that is…
We prove strong theorems for the local time at infinity of a nearest neighbor transient random walk. First, laws of the iterated logarithm are given for the large values of the local time. Then we investigate the length of intervals over…
In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods…
Consider a mixing dynamical systems $([0,1], T, \mu)$, for instance a piecewise expanding interval map with a Gibbs measure $\mu$. Given a non-summable sequence $(m_k)$ of non-negative numbers, one may define $r_k (x)$ such that $\mu (B(x,…