Related papers: Eigenvalue confinement and spectral gap for random…
We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…
In this paper, we study the spectral gap and principle eigenfunction of the random walk in the line segment $[1, N]$ with conductances $c^{(N)}(x, x+1)_{1\le x<N}$ where $c^{(N)}(x, x+1)>0$ is the rate of the random walk jumping from site…
In this work we continue the study of the Weyl asymptotics of the distribution of eigenvalues of non-self-adjoint (pseudo)differential operators with small random perturbations, by treating the case of multiplicative perturbations in…
We study the adjacent-transposition chain on the symmetric group $\mathfrak{S}_n$ with a regular parameter vector $\vec{p} = (p_{i,j})_{i\neq j}$. Fill's spectral gap conjecture, recently resolved in the affirmative by Greaves-Zhu, states…
We introduce the new concepts of pseu\-do numerical range for operator functions and families of sesquilinear forms as well as the pseu\-do block numerical range for $n \times n$ operator matrix functions. While these notions are new even…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
In this note we compare two recent results about the distribution of eigenvalues for semi-classical pseudodifferential operators in two dimensions. For classes of analytic operators A. Melin and the author obtained a complex Bohr-Sommerfeld…
Given an $n\times n$ matrix with integer entries in the range $[-h,h]$, how close can two of its distinct eigenvalues be? The best previously known examples have a minimum gap of $h^{-O(n)}$. Here we give an explicit construction of…
We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graphs $\mathcal G(N,p)$ for $p \in [N^{\varepsilon-1},N^{-\varepsilon}]$. We identify the joint limiting distributions of the…
This article is devoted to the spectral analysis of the electro-magnetic Schr\"odinger operator on the Euclidean plane. In the semiclassical limit, we derive a pseudo-differential effective operator that allows us to describe the spectrum…
We study a class of random matrices that appear in several communication and signal processing applications, and whose asymptotic eigenvalue distribution is closely related to the reconstruction error of an irregularly sampled bandlimited…
Non-Hermitian random matrices with statistical spectral characteristics beyond the standard Ginibre ensembles have recently emerged in the description of dissipative quantum many-body systems as well as in non-ergodic wave transport in…
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ vertices with diameter $d$. The minimizer graphs are known for…
This paper studies the size of the minimal gap between any two consecutive eigenvalues in the Dirichlet and in the Neumann spectrum of the standard Laplace operator on the Sierpinski gasket. The main result shows the remarkable fact that…
We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…
The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…
The properties of the first (largest) eigenvalue and its eigenvector (first eigenvector) are investigated for large sparse random symmetric matrices that are characterized by bimodal degree distributions. In principle, one should be able to…
We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…