Let $(X_1,\ldots,X_n)$ be a random variable in $(\mathbb{R}\setminus\{0\})^n$ that is both exchangeable and sign-invariant. For every $k\in[n]$, let $S_k=\sum_{i=1}^kX_i$. Define the weak persistence probability as $\mathbb{P}(S_1,\ldots,S_n\geq0)$, and the strong persistence probability as $\mathbb{P}(S_1,\ldots,S_n>0)$. From previous results, the optimal lower bound for $\mathbb{P}(S_1,\ldots,S_n\geq0)$ and the optimal upper bound for $\mathbb{P}(S_1,\ldots,S_n>0)$ are known. We complete the picture by determining the optimal upper bound for $\mathbb{P}(S_1,\ldots,S_n\geq0)$ and the optimal lower bound for $\mathbb{P}(S_1,\ldots,S_n>0)$ as follows. \[\frac{1}{2^n}\binom{n-1}{\lfloor (n-1)/2\rfloor}\leq\mathbb{P}(S_1,\ldots,S_n>0)\leq\frac{1}{4^n}\binom{2n}{n}\leq\mathbb{P}(S_1,\ldots,S_n\geq0)\leq\frac{1}{2^n}\binom{n}{\lfloor n/2\rfloor}.\] In particular, this implies that the weak and strong persistence probabilities of every exchangeable and sign-invariant random variable $(X_1,\ldots,X_n)$ in $(\mathbb{R}\setminus\{0\})^n$ are of the order $n^{-1/2}$. We also obtain some related results, one in the deterministic setting, and one when the random variables are allowed to take the value 0.
Let $n\ge2$, and let $X=(X_1,\ldots,X_n)$ be a centered Gaussian vector with $\mathrm{Var}(X_i)=1$ for every $i$. Let $Z_1,\ldots,Z_n$ be independent standard Gaussians, and put $\overline{Z}=(Z_1+\cdots+Z_n)/n$. We prove $\mathbb{P}\{\max_i X_i\le t\}\ge\mathbb{P}\{\sqrt{n/(n-1)}\,\max_i(Z_i-\overline{Z})\le t\}$ for...
Let $f_n:\{0,1\}^n\to\{0,1\}$ be Boolean functions, and let $C_n$ count their changes in a unit time interval under stationary dynamics in which each coordinate is independently resampled at rate one from the Bernoulli$(p_n)$ distribution. We prove that, if $f_n$ is transitive and $n\min\{p_n,1-p_n\}^{r}\to\infty$ for...
For each $s>0$, we consider a random Dirichlet series $X(s)=\sum_{k\geq 1}k^{-1/2-s}a_k\eta_k$, where $\eta_1$, $\eta_2,\ldots$ are independent and identically distributed random variables with mean zero and finite positive variance, and $(a_k)_{k\geq 1}$ is a deterministic sequence of real numbers satisfying $\sum_{k\...
Let $A=(\xi_{ij})$ be an $n\times n$ random matrix with independent, not necessarily identically distributed, real entries satisfying \[ \mathbb E\xi_{ij}=0,\qquad \mathbb E\xi_{ij}^{2}=1,\qquad \sup_{z\in\mathbb R}\mathbb P(|\xi_{ij}-z|0$ and $b\in(0,1)$. We prove that, for every $\delta\in(0,1)$, there are constants...
Manuel Fernández, Achintya Raya Polavarapu· 0 citations
Let $(S_n)_{n\geq 1}$ be the one-dimensional Elephant Random Walk (ERW) in the superdiffusive regime, with memory parameter $p\in(3/4,1)$ and first-step bias $\mathbb{P}(S_1=1)=q$. Set $a=2p-1\in(1/2,1)$. If $f_{q,a}$ denotes the density of the superdiffusive limit $L_{q,a}$, we prove the uniform local limit theorem $\...
We consider $n\times n$ covariance matrices $M=\frac{1}{n}XX^*$ where $X=(x_{i,j})$ is a matrix whose entries are independent complex random variables with $\mathbb{E}(x_{i,j})=0$ and $\mathbb{E}(|x_{i,j}|^2)=1$. We derive a $\frac{1}{n}$ expansion of the mixed moments, $\frac{1}{n}\mathbb{E}(\Tr(M^{(r_1)}\cdots M^{(r_...
D. George, Pei-Lun Tseng· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.