Related papers: The local circular law II: the edge case

For general non-Hermitian random matrices $X$ and deterministic deformation matrices $A$, we prove that the local eigenvalue statistics of $A+X$ close to the typical edge points of its spectrum are universal. Furthermore, we show that under…

We consider spectral properties of sparse sample covariance matrices, which includes biadjacency matrices of the bipartite Erd\H{o}s-R\'enyi graph model. We prove a local law for the eigenvalue density up to the upper spectral edge. Under a…

We consider the problem of finding an edge in a hidden undirected graph $G = (V, E)$ with $n$ vertices, in a model where we only allowed queries that ask whether or not a subset of vertices contains an edge. We study the non-adaptive model…

An $n$-vertex graph is called pancyclic if it contains a cycle of length $t$ for all $3 \leq t \leq n$. In this paper, we study pancyclicity of random graphs in the context of resilience, and prove that if $p \gg n^{-1/2}$, then the random…

Let $A_n$ be an $n\times n$ matrix with iid entries distributed as Bernoulli random variables with parameter $p = p_n$. Rudelson and Tikhomirov, in a beautiful and celebrated paper, show that the distribution of eigenvalues of $A_n \cdot…

One of the most well-known classical results for site percolation on the square lattice is the equation $p_c+p_c^*=1$. In words, this equation means that for all values $\neq p_c$ of the parameter $p$, the following holds: either a.s. there…

We show that the fluctuations of the largest eigenvalue of a real symmetric or complex Hermitian Wigner matrix of size $N$ converge to the Tracy--Widom laws at a rate $O(N^{-1/3+\omega})$, as $N$ tends to infinity. For Wigner matrices this…

We consider a random geometric graph $G(\chi_n, r_n)$, given by connecting two vertices of a Poisson point process $\chi_n$ of intensity $n$ on the unit torus whenever their distance is smaller than the parameter $r_n$. The model is…

Let $\mathcal A$ be the adjacency matrix of the Erd\H{o}s-R\'{e}nyi directed graph $\mathscr G(N,p)$. We denote the eigenvalues of $\mathcal A$ by $\lambda_1^{\cal A},...,\lambda^{\cal A}_N$, and $|\lambda_1^{\cal A}|=\max_i|\lambda_i^{\cal…

We get a local existence result in $H^s$ with $s>3/2$ for second order quasilinear wave equation with radial initial data in 2+1 dimensions, based on an improvement of Strichartz estimate in the radial case. Moreover, we get the…

We describe an elementary method to get non-asymptotic estimates for the moments of Hermitian random matrices whose elements are Gaussian independent random variables. As the basic example, we consider the GUE matrices. Immediate…

This paper gives a rigorous proof of a conjectured statistical self-similarity property of the eigenvalues random matrices from the Circular Unitary Ensemble. We consider on the one hand the eigenvalues of an $n \times n$ CUE matrix, and on…

The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study…

We show that the spectral radius of an $N\times N$ random symmetric matrix with i.i.d. bounded centered but non-symmetrically distributed entries is bounded from above by $ 2 \*\sigma + o(N^{-6/11+\epsilon}), $ where $\sigma^2 $ is the…

Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…

For a positive integer $r$, let $G(r)$ be the smallest $N$ such that, whenever the edges of the Cartesian product $K_N \times K_N$ are $r$-coloured, then there is a rectangle in which both pairs of opposite edges receive the same colour. In…

We prove an optimal order delocalization estimate for the eigenvectors of general $N \times N$ non-Hermitian matrices $X$: $\| {\bf v } \|_\infty \leq C \sqrt{\frac{\log N}{N}}$ with very high probability, for any right or left eigenvector…

This is the second of a series of two papers dealing with local limit theorems in relatively hyperbolic groups. In this second paper, we restrict our attention to non-spectrally degenerate random walks and we prove precise asymptotics of…

One of the most well-known classical results for site percolation on the square lattice is the equation p_c + p_c^* = 1. In words, this equation means that for all values different from p_c of the parameter p the following holds: Either…

Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemer\'edi's theorem with random differences is bounded from above by $N^{1-\frac{2}{k} + o(1)}$ for length-$k$ progressions. This…