Related papers: Eigenvalue confinement and spectral gap for random…

Several years ago Linial and Meshulam introduced a model called X_d(n,p) of random n-vertex d-dimensional simplicial complexes. The following question suggests itself very naturally: What is the threshold probability p=p(n) at which the…

Let $A$ be an $n\times n$ matrix with iid entries where $A_{ij} \sim \mathrm{Ber}(p)$ is a Bernoulli random variable with parameter $p = d/n$. We show that the empirical measure of the eigenvalues converges, in probability, to a…

This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…

This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary…

The limiting distribution of eigenvalues of N x N random matrices has many applications. One of the most studied ensembles are real symmetric matrices with independent entries iidrv; the limiting rescaled spectral measure (LRSM)…

Let p(k) denote the partition function of k. For each k >= 2, we describe a list of p(k)-1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness of…

We describe the spectrum of a non-self-adjoint elliptic system on a finite interval. Under certain conditions we find that the eigenvalues form a discrete set and converge asymptotically at infinity to one of several straight lines. The…

The current work applies some recent combinatorial tools due to Jain to control the eigenvalue gaps of a matrix $M_n = M + N_n$ where $M$ is deterministic, symmetric with large operator norm and $N_n$ is a random symmetric matrix with…

Network geometries are typically characterized by having a finite spectral dimension (SD), $d_{s}$ that characterizes the return time distribution of a random walk on a graph. The main purpose of this work is to determine the SD of a…

We consider a simple model of an open partially expanding map. Its trapped set K in phase space is a fractal set. We first show that there is a well defined discrete spectrum of Ruelle resonances which describes the asymptotics of…

We show that, with very high probability, the random graph Laplacian has simple spectrum. Our method provides a quantitatively effective estimate of the spectral gaps. Along the way, we establish results on affine no-gaps delocalization,…

We consider random $d$-regular graphs on $N$ vertices, with degree $d$ at least $(\log N)^4$. We prove that the Green's function of the adjacency matrix and the Stieltjes transform of its empirical spectral measure are well approximated by…

M.Levitin and E.Shargorodsky purposed in a recent article, [math.SP/0212087], the use of the so called ``second order relative spectrum'', to find eigenvalues of self-adjoint operators in gaps of the essential spectrum. Let $M$ be a…

For the correlated Gaussian Wishart ensemble we compute the distribution of the smallest eigenvalue and a related gap probability.We obtain exact results for the complex (\beta=2) and for the real case (\beta=1). For a particular set of…

Following the semiclassical formalism of Strutinsky et al., we have obtained the complete eigenvalue spectrum for a particle enclosed in an infinitely high spheroidal cavity. Our spheroidal trace formula also reproduces the results of a…

We consider the empirical eigenvalue distribution of an $m\times m$ principal submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. For $n$ and $m$ large with $\frac{m}{n}=\alpha$, the empirical spectral…

Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give…

This paper is devoted to a general min-max characterization of the eigenvalues in a gap of the essential spectrum of a self-adjoint unbounded operator. We prove an abstract theorem, then we apply it to the case of Dirac operators with a…

The one-dimensional Dirac operator \begin{equation*} L = i \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} \frac{d}{dx} +\begin{pmatrix} 0 & P(x) \\ Q(x) & 0 \end{pmatrix}, \quad P,Q \in L^2 ([0,\pi]), \end{equation*} considered on $[0,\pi]$…

For two lacunary sequences $(M_{n,1})_{n\geq 2},(M_{n,2})_{n\geq 0}$ and suitable functions $f$ we introduce random matrix ensembles with \begin{equation*} X_{n,n'}=f(M_{n+n',1}x_1,M_{|n-n'|,2}x_2). \end{equation*} We prove weak convergence…