The law of series

Tomasz Downarowicz; Yves Lacroix

Home/Archive/arXiv

arXiv · math/0601166

The law of series

Tomasz Downarowicz·Yves Lacroix

View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove a general ergodic-theoretic result concerning the return time statistic, which, properly understood, sheds some new light on the common sense phenomenon known as {\it the law of series}. Let \proc be an ergodic process on finitely many states, with positive entropy. We show that the distribution function of the normalized waiting time for the first visit to a small cylinder set $B$ is, for majority of such cylinders and up to epsilon, dominated by the exponential distribution function $1-e^{-t}$. This fact has the following interpretation: The occurrences of such a "rare event" $B$ can deviate from purely random in only one direction -- so that for any length of an "observation period" of time, the first occurrence of $B$ "attracts" its further repetitions in this period.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Tomasz Downarowicz, Yves Lacroix. 2006-01-09. The law of series. https://arxiv.org/abs/math/0601166

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗

arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗

arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗