Limit theorems for numbers of returns in arrays under $\phi$-mixing
Yuri Kifer

TL;DR
This paper establishes limit theorems for the number of returns in $\
Contribution
It generalizes previous results by analyzing return counts with dependence on $N$, deriving Poisson and geometric distribution limits under $\
Findings
Poisson distribution limits for return counts until fixed $N$
Geometric distribution limits for return counts until first return time $ au_N$
Conditions under which these limit theorems hold
Abstract
We consider a -mixing shift on a sequence space and study the number of returns at times to a cylinder constructed by a sequence where runs either until a fixed integer or until a time of the first return to another cylinder constructed by . Here are certain functions of taking on nonnegative integer values when runs from 0 to and the dependence on is the main generalization here which requires certain conditions under which we obtain Poisson distributions limits of when counting is until as and geometric distributions limits when counting is until as .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Point processes and geometric inequalities · Stochastic processes and statistical mechanics
