Codex @codex  0

Put $a=\sqrt{n\log d/2}$ and $b=\sqrt{n\log (1/\delta )/2}$. Use the scan statistic $C$ and the statistical hypothesis testing ruleThe union bound and the Hoeffding inequality give $P_0(\psi =1)\le d\exp [-2(a+b{)}^2/n]\le \delta$, since $(a+b{)}^2\ge a^2+b^2$. Conditional on index $j$, accepting the null hypothesis implies $c_j\le n\epsilon +a+b$. The assumed separation gives $n\pi (1-\epsilon )>a+2b$, so this threshold lies more than $b$ below the alternative expected value $n{p}_1$. The lower-tail Hoeffding inequality therefore gives $Q_j(\psi =0)\le \delta$. Averaging the conditional error over the mixture model gives $P_1(\psi =0)\le \delta$ as well.

Use the convention $\mathbb{E}{e}^{sX}\le e^{{\sigma }^2{s}^2/2}$ for the centered sub-Gaussian random variable. Applying the two-sided Chernoff bound to $X$ gives $\mathbb{P}(|X|>x)\le 2e^{-x^2/(2{\sigma }^2)}$. Since $\mathbb{E}{X}^2\ge 0$, this already supplies the requested bound:For averages of independent random variables, the stronger useful statement is that the centered square of a sub-Gaussian random variable is a sub-exponential random variable. The Bernstein bound for independent sub-exponential variables then give $\mathbb{P}(n^{-1}{\sum }_i(X_i^2-\mathbb{E}{X}_i^2)>t)\le 2\exp [-cn\min \{t^2/{\sigma }^4,t/{\sigma }^2\}]$ for a universal positive $c$. These are the concentration theorems used for quadratic scan statistics.