Related papers: Hitting and returning into rare events for all alp…

In this paper we study the distribution of hitting and return times for observations of dynamical systems. We apply this results to get an exponential law for the distribution of hitting and return times for rapidly mixing random dynamical…

We consider the superposition of symmetric simple exclusion dynamics speeded-up in time, with spin-flip dynamics in a one-dimensional interval with periodic boundary conditions. We show that the mixing time has an exponential lower bound in…

Let $X_N$ be an $N\ts N$ random symmetric matrix with independent equidistributed entries. If the law $P$ of the entries has a finite second moment, it was shown by Wigner \cite{wigner} that the empirical distribution of the eigenvalues of…

A multiplicative identity in law connecting the hitting times of completely asymmetric $\alpha-$stable L\'evy processes in duality is established. In the spectrally positive case, this identity allows with an elementary argument to compute…

Given an ergodic dynamical system $(X,T,\mu)$, and $U\subset X$ measurable with $\mu (U)>0$, let $\mu (U)\tau_U(x)$ denote the normalized hitting time of $x\in X$ to $U$. We prove that given a sequence $(U_n)$ with $\mu (U_n)\to 0$, the…

For a $\psi$-mixing stationary process $\xi_0,\xi_1,\xi_2,...$ we consider the number $\mathcal N_N$ of multiple recurrencies $\{\xi_{q_i(n)}\in\Gamma_N,\, i=1,...,\ell\}$ to a set $\Gamma_N$ for $n$ until the moment $\tau_N$ (which we call…

Motivated by entropy estimation from chaotic time series, we provide a comprehensive analysis of hitting times of cylinder sets in the setting of Gibbsian sources. We prove two strong approximation results from which we easily deduce…

We consider an ergodic process on finitely many states, with positive entropy. Our first main result asserts that the distribution function of the normalized waiting time for the first visit to a small (i.e., over a long block) cylinder set…

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…

We study convergence of return- and hitting-time distributions of small sets $E_{k}$ with $\mu(E_{k})\rightarrow0$ in recurrent ergodic dynamical systems preserving an infinite measure $\mu$. Some properties which are easy in finite measure…

We investigate the probability of observing a given pattern of $n$ rises and falls in a random stationary data series. The data are modelled as a sequence of $n+1$ independent and identically distributed random numbers. This probabilistic…

Let 0<\alpha<1/2. We show that the mixing time of a continuous-time reversible Markov chain on a finite state space is about as large as the largest expected hitting time of a subset of stationary measure at least \alpha of the state space.…

Starting from an n-by-n matrix of zeros, choose uniformly random zero entries and change them to ones, one-at-a-time, until the matrix becomes invertible. We show that with probability tending to one as n tends to infinity, this occurs at…

In this paper we study the distribution of hitting times for a class of random dynamical systems. We prove that for invariant measures with super-polynomial decay of correlations hitting times to dynamically defined cylinders satisfy…

We show that the hitting times for points of real $\alpha-$stable L\'evy processes ($1<\alpha\le 2$) are unimodal random variables. The argument relies on strong unimodality and several recent multiplicative identities in law. In the…

There is a natural connection between two types of recurrence law: hitting times to shrinking targets, and hitting times to a fixed target (usually seen as escape through a hole). We show that for systems which mix exponentially fast, one…

We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent…

We construct a zero-entropy weakly mixing finite-valued process with the exponential limit law for return resp. hitting times. This limit law is obtained in almost every point, taking the limit along the full sequence of cylinders around…

Haydn, Lacroix and Vaienti [Ann. Probab. 33 (2005)] proved that, for a given ergodic map, the entry time distribution converges in the small target limit, if and only if the corresponding return time distribution converges. The present note…

A very simple event frequency approximation algorithm that is sensitive to event timeliness is suggested. The algorithm iteratively updates categorical click-distribution, producing (path of) a random walk on a standard $n$-dimensional…