English
Related papers

Related papers: Large deviations in Selberg's central limit theore…

200 papers

For $1\le p \le \infty$, the Fr\'echet $p$-mean of a probability measure on a metric space is an important notion of central tendency that generalizes the usual notions in the real line of mean ($p=2$) and median ($p=1$). In this work we…

Probability · Mathematics 2025-07-03 Steven N. Evans , Adam Q. Jaffe

Consider the sample covariance matrix $$\Sigma^{1/2}XX^T\Sigma^{1/2}$$ where $X$ is an $M\times N$ random matrix with independent entries and $\Sigma$ is an $M\times M$ diagonal matrix. It is known that if $\Sigma$ is deterministic, then…

Probability · Mathematics 2023-02-27 Ji Oon Lee , Yiting Li

We establish a central limit theorem for the log-determinant $\log|\det(M_n)|$ of a Wigner matrix $M_n$, under the assumption of four matching moments with either the GUE or GOE ensemble. More specifically, we show that this log-determinant…

Probability · Mathematics 2012-03-30 Terence Tao , Van Vu

We study asymptotic probabilities of attaining the maximum in heterogeneous Gaussian samples. In the two-group setting, the first sample has variance $1$ and size $n_1$, while the second has variance $\sigma^2>1$ and size $n_2$. We…

Probability · Mathematics 2026-05-21 Chunxu Zhang , Baiqi Miao , Tiantian Mao

We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than $\epsilon$ ($\epsilon$ > 0). Is is known ([BM05]) that the empirical measure of these fragments converges in law, under some…

Probability · Mathematics 2019-07-30 Sylvain Rubenthaler

In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…

Probability · Mathematics 2024-07-08 Zhishui Hua , Wei Wanga , Liang Dong

We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality…

Probability · Mathematics 2007-06-13 Oliver Johnson , Richard Samworth

We consider the logarithm of the central value $\log L(1/2)$ in the orthogonal family ${L(s,f)}_{f \in H_k}$ where $H_k$ is the set of weight $k$ Hecke-eigen cusp form for $SL_2(\mathbb{Z})$, and in the symplectic family…

Number Theory · Mathematics 2014-11-25 Bob Hough

We consider a model of the Riemann zeta function on the critical axis and study its maximum over intervals of length $(\log T)^{\theta}$, where $\theta$ is either fixed or tends to zero at a suitable rate. It is shown that the deterministic…

Probability · Mathematics 2022-10-26 Louis-Pierre Arguin , Guillaume Dubach , Lisa Hartung

We consider a class of non-conformal expanding maps on the $d$-dimensional torus. For an equilibrium measure of an H\"older potential, we prove an analogue of the Central Limit Theorem for the fluctuations of the logarithm of the measure of…

Dynamical Systems · Mathematics 2009-12-17 Renaud Leplaideur , Benoit Saussol

The Selberg sieve provides majorants for certain arithmetic sequences, such as the primes and the twin primes. We prove an L^2-L^p restriction theorem for majorants of this type. An immediate application is to the estimation of exponential…

Number Theory · Mathematics 2007-05-23 Ben Green , Terence Tao

The empirical Orlicz norm based on a random sample is defined as a natural estimator of the Orlicz norm of a univariate probability distribution. A law of large numbers is derived under minimal assumptions. The latter extends readily to a…

Statistics Theory · Mathematics 2026-03-12 Fabian Mies

We prove, assuming the Riemann Hypothesis, that \int_{T}^{2T} |\zeta(1/2+it)|^{2k} dt \ll_{k} T log^{k^{2}} T for any fixed k \geq 0 and all large T. This is sharp up to the value of the implicit constant. Our proof builds on well known…

Number Theory · Mathematics 2013-05-21 Adam J. Harper

We give a general local central limit theorem for the sum of two independent random variables, one of which satisfies a central limit theorem while the other satisfies a local central limit theorem with the same order variance. We apply…

Probability · Mathematics 2011-08-16 Mathew D. Penrose , Yuval Peres

We prove that among 1 and the odd zeta values $\zeta(3)$, $\zeta(5)$, \ldots, $\zeta(s)$, at least $ 0.21 \sqrt{s}/\sqrt{\log s}$ are linearly independent over the rationals, for any sufficiently large odd integer $s$. This is the first…

Number Theory · Mathematics 2025-12-01 Stéphane Fischler

We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…

Data Structures and Algorithms · Computer Science 2017-09-08 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

Let $L(s, \chi_1), \ldots, L(s, \chi_N)$ be primitive Dirichlet $L$-functions different from the Riemann zeta function. Under suitable hypotheses we prove that any linear combination $a_1\log|L(\rho,\chi_1)|+\dots+a_N\log|L(\rho,\chi_N)|$…

Number Theory · Mathematics 2025-04-14 Fatma Çiçek , Steven M. Gonek , Scott J. Kirila

In this paper, we study the random field \begin{equation*} X(h) \circeq \sum_{p \leq T} \frac{\text{Re}(U_p \, p^{-i h})}{p^{1/2}}, \quad h\in [0,1], \end{equation*} where $(U_p, \, p ~\text{primes})$ is an i.i.d. sequence of uniform random…

Probability · Mathematics 2022-05-25 Louis-Pierre Arguin , Frédéric Ouimet

Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\{0,1\}$-matrix, and many others) reduce to creating random…

Computation · Statistics 2017-06-30 Mark Huber

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Computational Complexity · Computer Science 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio