Related papers: Eigenvalue confinement and spectral gap for random…

We investigate the eigenvalue statistics of random Bernoulli matrices, where the matrix elements are chosen independently from a binary set with equal probability. This is achieved by initiating a discrete random walk process over the space…

We study the semigroup of the symmetric $\alpha$-stable process in bounded domains in $\R^2$. We obtain a variational formula for the spectral gap, i.e. the difference between two first eigenvalues of the generator of this semigroup. This…

We compute the spectra of the adjacency matrices of the semi-regular polytopes. A few different techniques are employed: the most sophisticated, which relates the 1-skeleton of the polytope to a Cayley graph, is based on methods akin to…

We show that the spectral gap of a random walk on the domain of normal attraction of an $\alpha$-stable law is of order $\mathcal O(n^{\alpha})$ when restricted to boxes of size $n$. The proof is based on a comparison principle that may be…

In this paper we consider an asymptotic question in the theory of the Gaussian Unitary Ensemble of random matrices. In the bulk scaling limit, the probability that there are no eigenvalues in the interval (0,2s) is given by P_s=det(I-K_s),…

The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of…

Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…

We consider an $n\times n$ matrix of independent real Gaussian random variables and determine the asymptotic distribution of the smallest gaps between complex eigenvalues.

The minimax principle for eigenvalues in gaps of the essential spectrum in the form presented by Griesemer, Lewis, and Siedentop in [Doc. Math. 4 (1999), 275--283] is adapted to cover certain abstract perturbative settings with bounded or…

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

Let $G_n$ be an $n \times n$ matrix with real i.i.d. $N(0,1/n)$ entries, let $A$ be a real $n \times n$ matrix with $\Vert A \Vert \le 1$, and let $\gamma \in (0,1)$. We show that with probability $0.99$, $A + \gamma G_n$ has all of its…

Let $\Gamma$ be a distance-regular graph with diameter $d$ and Kneser graph $K=\Gamma_d$, the distance-$d$ graph of $\Gamma$. We say that $\Gamma$ is partially antipodal when $K$ has fewer distinct eigenvalues than $\Gamma$. In particular,…

A recent development in random matrix theory, the intrinsic freeness principle, establishes that the spectrum of very general random matrices behaves as that of an associated free operator. This reduces the study of such random matrices to…

We investigate the statistics of the largest eigenvalue, $\lambda_{\rm max}$, in an ensemble of $N\times N$ large ($N\gg 1$) sparse adjacency matrices, $A_N$. The most attention is paid to the distribution and typical fluctuations of…

We consider a second order self-adjoint operator in a domain which can be bounded or unbounded. The boundary is partitioned into two parts with Dirichlet boundary condition on one of them, and Neumann condition on the other. We assume that…

Motivated by the intriguing behavior displayed in a dynamic network that models a population of extreme introverts and extroverts (XIE), we consider the spectral properties of ensembles of random split graph adjacency matrices. We discover…

In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…

Consider the long-range percolation model on the integer lattice $\mathbb{Z}^d$ in which all nearest-neighbour edges are present and otherwise $x$ and $y$ are connected with probability $q_{x,y}:=1-\exp(-|x-y|^{-s})$, independently of the…

What is the connection of random matrices with integrable systems? Is this connection really useful? Introducing apprpriate times in the distribution of the ensemble of matrices, one shows that the corresponding distribution of the…

Denote by $A$ the adjacency matrix of an Erdos-Renyi graph with bounded average degree. We consider the problem of maximizing $\langle A-E\{A\},X\rangle$ over the set of positive semidefinite matrices $X$ with diagonal entries $X_{ii}=1$.…