Related papers: Overlaps, Eigenvalue Gaps, and Pseudospectrum unde…

Following recent work by Koll\'{a}r and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs, denoted $\Delta_n$ and $\Gamma_n$ which are more…

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…

Spectral correlations in unitary invariant, non-Gaussian ensembles of large random matrices possessing an eigenvalue gap are studied within the framework of the orthogonal polynomial technique. Both local and global characteristics of…

This paper considers $N\times N$ matrices of the form $A_\gamma =A+ \gamma B$, where $A$ is self-adjoint, $\gamma \in C$ and $B$ is a non-self-adjoint perturbation of $A$. We obtain some monodromy-type results relating the spectral…

We look at the eigenvalues of the complex Ginibre Ensemble of random matrices consisting of $N$ eigenvalues. We study the event that for $ {c \in [0,1]}$, $\lfloor cN \rfloor$ of the eigenvalues are located outside of a disk of radius $ R…

We consider large Information-Plus-Noise type matrices of the form $M_N=(\sigma \frac{X_N}{\sqrt{N}}+A_N)(\sigma \frac{X_N}{\sqrt{N}}+A_N)^*$ where $X_N$ is an $n \times N$ ($n\leq N)$ matrix consisting of independent standardized complex…

We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…

Let $G=G(n,p_n)$ be a homogeneous Erd\"os-R\'enyi graph, and $A$ its adjacency matrix with eigenvalues $\lambda_1(A) \geq \lambda_2(A) \geq ... \geq \lambda_n(A).$ Local laws have been used to show that $lambda_2(A)$ can exhibit…

Reliable and efficient computation of the pseudospectral abscissa in the large-scale setting is still not settled. Unlike the small-scale setting where there are globally convergent criss-cross algorithms, all algorithms in the large-scale…

We show that the multiplicity of the second normalized adjacency matrix eigenvalue of any connected graph of maximum degree $\Delta$ is bounded by $O(n \Delta^{7/5}/\log^{1/5-o(1)}n)$ for any $\Delta$, and by…

Random Hermitian matrices with a source term arise, for instance, in the study of non-intersecting Brownian walkers \cite{Adler:2009a, Daems:2007} and sample covariance matrices \cite{Baik:2005}. We consider the case when the $n\times n$…

We consider the problem of constrained Ginibre ensemble with prescribed portion of eigenvalues on a given curve $\Gamma\subset \mathbb R^2$ and relate it to a thin obstacle problem. The key step in the proof is the $H^1$ estimate for the…

We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…

We consider eigenvalues of a product of n non-Hermitian, independent random matrices. Each matrix in this product is of size N\times N with independent standard complex Gaussian variables. The eigenvalues of such a product form a…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

The complex Ginibre ensemble is an $N\times N$ non-Hermitian random matrix over $\mathbb{C}$ with i.i.d. complex Gaussian entries normalized to have mean zero and variance $1/N$. Unlike the Gaussian unitary ensemble, for which the…

We show that for a given set $\Lambda$ of $nk$ distinct real numbers $\lambda_1, \lambda_2, \ldots, \lambda_{nk}$ and $k$ graphs on $n$ nodes, $G_0, G_1,\ldots,G_{k-1}$, there are real symmetric $n\times n$ matrices $A_s$, $s=0,1,\ldots,…

Some properties that nominally involve the eigenvalues of Gaussian Unitary Ensemble (GUE) can instead be phrased in terms of singular values. By discarding the signs of the eigenvalues, we gain access to a surprising decomposition: the…

Given a square complex matrix $A$, we tackle the problem of finding the nearest matrix with multiple eigenvalues or, equivalently when $A$ had distinct eigenvalues, the nearest defective matrix. To this goal, we extend the general framework…

Let $A$ be an $n\times n$ real matrix, and let $M$ be an $n\times n$ random matrix whose entries are i.i.d sub-Gaussian random variables with mean $0$ and variance $1$. We make two contributions to the study of $s_n(A+M)$, the smallest…