Related papers: Shrinking targets versus recurrence: the quantitat…
Let $\xi$ be a random integer vector, having uniform distribution \[\mathbf{P} \{\xi = (i_1,i_2,...,i_n) = 1/n^n \} \ \hbox{for} \ 1 \leq i_1,i_2,...,i_n\leq n.\] A realization $(i_1,i_2,...,i_n)$ of $\xi$ is called \textit{good}, if its…
Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…
The Khintchine recurrence theorem asserts that on a measure preserving system, for every set $A$ and $\varepsilon>0$, we have $\mu(A\cap T^{-n}A)\geq \mu(A)^2-\varepsilon$ for infinitely many $n\in \mathbb{N}$. We show that there are…
We extend the Dirichlet principle to non-reversible Markov processes on countable state spaces. We present two variational formulas for the solution of the Poisson equation or, equivalently, for the capacity between two disjoint sets. As an…
Let $Q$ be a transition probability on a measurable space $E$, let $(X\_n)\_n$ be a Markov chain associated to $Q$, and let $\xi$ be a real-valued measurable function on $E$, and $S\_n = \sum\_{k=1}^{n} \xi(X\_k)$. Under functional…
We study multiple recurrence without commutativity in this paper. We show that for any two homeomorphisms $T,S: X\rightarrow X$ with $(X,T)$ and $(X,S)$ being minimal, there is a residual subset $X_0$ of $X$ such that for any $x\in X_0$ and…
Linear regression is a basic and widely-used methodology in data analysis. It is known that some quantum algorithms efficiently perform least squares linear regression of an exponentially large data set. However, if we obtain values of the…
For a set $S$ of $n$ disjoint line segments in $\mathbb{R}^{2}$, the visibility counting problem is to preprocess $S$ such that the number of visible segments in $S$ from any query point $p$ can be computed quickly. There have been…
Recasting the $N$-point one loop scalar integral as a probabilistic problem, allows the derivation of integral recurrence relations as well as exact analytical expressions in the most common cases. $\epsilon$ expansions are derived by…
Let $p_1,...,p_{s+1}$ be distinct primes and let $T_{p_i}$ be the von Niemann - Kakutani adding machine $(1 \leq i \leq s)$, $T_{\mathcal{P}}(\mathbf{x}) =(T_{p_1}(x_1),..., T_{p_s}(x_s))$. Let $y_i \in (0,1)$ be a $p_{s+1}$-rational $(1…
Quantiles, such as the median or percentiles, provide concise and useful information about the distribution of a collection of items, drawn from a totally ordered universe. We study data structures, called quantile summaries, which keep…
Let $\psi$ be a continuous decreasing function defined on all large positive real numbers. We say that a real $m\times n$ matrix $A$ is $\psi$-Dirichlet if for every sufficiently large real number $t$ one can find $\mathbf{p} \in…
Let $\vec{w} = (w_1,\dots, w_n) \in \mathbb{R}^{n}$. We show that for any $n^{-2}\le\epsilon\le 1$, if \[\#\{\vec{\xi} \in \{0,1\}^{n}: \langle \vec{\xi}, \vec{w} \rangle = \tau\} \ge 2^{-\epsilon n}\cdot 2^{n}\] for some $\tau \in…
The goal of (stable) sparse recovery is to recover a $k$-sparse approximation $x*$ of a vector $x$ from linear measurements of $x$. Specifically, the goal is to recover $x*$ such that ||x-x*||_p <= C min_{k-sparse x'} ||x-x'||_q for some…
For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on…
Let $\xi$ n , n $\in$ N be a sequence of i.i.d. random variables with values in Z. The associated random walk on Z is S(n) = $\xi$ 1 + $\times$ $\times$ $\times$ + $\xi$ n+1 and the corresponding "reflected walk" on N 0 is the Markov chain…
For real $\xi$ we consider the irrationality measure function $\psi_\xi(t) = \min_{1\leqslant q \leqslant t, q\in\mathbb{Z}} || q\xi ||$, where $||\cdot||$ - distance to the nearest integer. We prove that in the case…
For $p \in (0,1)$, sample a binary sequence from the infinite product measure of Bernoulli$(p)$ distributions. It is known that for $p=1/2$, almost every binary sequence is Poisson generic in the sense of Peres and Weiss, a property that…
Let $T$ be a $d\times d$ matrix with real coefficients. Then $T$ determines a self-map of the $d$-dimensional torus ${\Bbb T}^d={\mathbb{R}}^d/{\Bbb Z}^d$. Let $ \{E_n \}_{n \in \mathbb{N}} $ be a sequence of subsets of ${\Bbb T}^d$ and let…
The Central Limit Theorem provides a foundation for inferential statistics and hypothesis testing. It describes how standardized statistics behave under repeated sampling from large populations. However, if the size of the sample (n)…