Related papers: Quantitative Edge Eigenvector Universality for Ran…
We prove that the sum of $t$ boolean-valued random variables sampled by a random walk on a regular expander converges in total variation distance to a discrete normal distribution at a rate of $O(\lambda/t^{1/2-o(1)})$, where $\lambda$ is…
Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…
We study the random conductance model on the lattice $\mathbb{Z}^d$, i.e. we consider a linear, finite-difference, divergence-form operator with random coefficients and the associated random walk under random conductances. We allow the…
Suppose that the (normalised) partial sum of a stationary sequence converges to a standard normal random variable. Given sufficiently moments, when do we have a rate of convergence of $n^{-1/2}$ in the uniform metric, in other words, when…
We demonstrate that quantum correlations can emerge from the statistical correlations of random discrete models, without an a priori assumption that the random models are quantum mechanical in nature, that is without considering…
This paper establishes a non-uniform Berry--Esseen bound for non-normal approximation using Stein's method. The main theorem generalizes the result of the authors in [Comptes Rendus Mathematique, 2024] to the context of non-normal…
A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…
We describe a new universality class for unitary invariant random matrix ensembles. It arises in the double scaling limit of ensembles of random $n \times n$ Hermitian matrices $Z_{n,N}^{-1} |\det M|^{2\alpha} e^{-N \Tr V(M)} dM$ with…
We consider the deformed Gaussian ensemble $H_n=H_n^{(0)}+M_n$ in which $H_n^{(0)}$ is a hermitian matrix (possibly random) and $M_n$ is the Gaussian unitary random matrix (GUE) independent of $H_n^{(0)}$. Assuming that the Normalized…
Due to the effort of a number of authors, the value c_u of the absolute constant factor in the uniform Berry--Esseen (BE) bound for sums of independent random variables has been gradually reduced to 0.4748 in the iid case and 0.5600 in the…
New nonuniform Berry--Esseen-type bounds for sums of independent random variables are obtained, motivated by recent studies concerning such bounds for nonlinear statistics. The proofs are based on the Chen--Shao concentration techniques…
We prove a Berry-Esseen bound in de Jong's classical CLT for normalized, completely degenerate $U$-statistics, which says that the convergence of the fourth moment sequence to three and a Lindeberg-Feller type negligibility condition are…
We propose an efficient $\epsilon$-differentially private algorithm, that given a simple {\em weighted} $n$-vertex, $m$-edge graph $G$ with a \emph{maximum unweighted} degree $\Delta(G) \leq n-1$, outputs a synthetic graph which…
We consider the edge statistics of Dyson Brownian motion with deterministic initial data. Our main result states that if the initial data has a spectral edge with rough square root behavior down to a scale $\eta_* \geq N^{-2/3}$ and no…
We consider the eigenvectors of the principal minor of dimension $n< N$ of the Dyson Brownian motion in $\mathbb{R}^{N}$ and investigate their asymptotic overlaps with the eigenvectors of the full matrix in the limit of large dimension. We…
In this work we study the rate of convergence in the central limit theorem for the Euclidean norm of random orthogonal projections of vectors chosen at random from an $\ell_p^n$-ball which has been obtained in [Alonso-Guti\'errez, Prochno,…
We consider the configuration model and the uniform simple graph with given degree sequence $\boldsymbol{d}=\left(d_i\right)_{i=1}^n$. We derive quantitative bounds for the errors in (i) joint normal-Poisson approximation to the numbers of…
In this paper we prove the semi-circular law for the eigenvalues of regular random graph $G_{n,d}$ in the case $d\rightarrow \infty$, complementing a previous result of McKay for fixed $d$. We also obtain a upper bound on the infinity norm…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…
We establish a general Berry-Esseen type bound which gives optimal bounds in many situations under suitable moment assumptions. By combining the general bound with Palm theory, we deduce a new error bound for assessing the accuracy of…