Related papers: A second moment proof of the spread lemma
Hwang's quasi-power theorem asserts that a sequence of random variables whose moment generating functions are approximately given by powers of some analytic function is asymptotically normally distributed. This theorem is generalised to…
Inference problems with conjectured statistical-computational gaps are ubiquitous throughout modern statistics, computer science and statistical physics. While there has been success evidencing these gaps from the failure of restricted…
We introduce the asymptotic spectrum of graphs and apply the theory of asymptotic spectra of Strassen (J. Reine Angew. Math. 1988) to obtain a new dual characterisation of the Shannon capacity of graphs. Elements in the asymptotic spectrum…
In 2018, Kahle and Stump raised the following problem: identify sequences of finite Coxeter groups $W_n$ for which the two-sided descent statistics on a uniform random element of $W_n$ is asymptotically normal. Recently, Br\"uck and…
This paper re-introduces the network reliability polynomial - introduced by Moore and Shannon in 1956 -- for studying the effect of network structure on the spread of diseases. We exhibit a representation of the polynomial that is…
We prove two results on arithmetic quantum chaos for dihedral Maass forms, both of which are manifestations of Berry's random wave conjecture: Planck scale mass equidistribution and an asymptotic formula for the fourth moment. For level $1$…
Hwang's quasi-power theorem asserts that a sequence of random variables whose moment generating functions are approximately given by powers of some analytic function is asymptotically normally distributed. This theorem is generalised to…
Recently, a short proof of the Harris-Kesten result that the critical probability for bond percolation in the planar square lattice is 1/2 was given, using a sharp threshold result of Friedgut and Kalai. Here we point out that a key part of…
There are $n$ independent Bernoulli random variables $I_{k}$ with parameters $p_{k}$ that are observed sequentially. We consider a generalization of the Last-Success-Problem considering $w_{k}$ positive payments if the player successfully…
The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…
Various quantum analogues of the central limit theorem, which is one of the cornerstones of probability theory, are known in the literature. One such analogue, due to Cushen and Hudson, is of particular relevance for quantum optics. It…
Croot, Lev and Pach used a new polynomial technique to give a new exponential upper bound for the size of three-term progression-free subsets in the groups $(\mathbb Z _4)^n$. The main tool in proving their striking result is a simple lemma…
We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a…
We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing $n$ copies of a function $f$, even with a small success probability of $\gamma^n$, requires $\Theta(n)$…
We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…
The paper is devoted to the spreading of a message within the random graph evolving by the Norros-Reittu preferential attachment model. The latter model forms random Poissonian numbers of edges between newly added nodes and existing ones.…
We derive a refined conjecture for the variance of Gaussian primes across sectors, with a power saving error term, by applying the L-functions Ratios Conjecture. We observe a bifurcation point in the main term, consistent with the Random…
We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs…
We obtain a strong bound on the second moment of the $GL_3$ standard $L$-function on the critical line. The method builds on the recent work of Aggarwal, Leung, and Munshi which treated shorter intervals. We deduce some corollaries…
A generalization of fluctuation theorems in stochastic processes is proposed. The new theorem is written in terms of posterior probabilities, which are introduced via the Bayes theorem. In usual fluctuation theorems, a forward path and its…