Related papers: Eigenvalue confinement and spectral gap for random…

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

We study location of eigenvalues of one-dimensional discrete Schr\"odinger operators with complex $\ell^{p}$-potentials for $1\leq p\leq \infty$. In the case of $\ell^{1}$-potentials, the derived bound is shown to be optimal. For $p>1$, two…

We consider a sparse random subraph of the $n$-cube where each edge appears independently with small probability $p(n) =O(n^{-1+o(1)})$. In the most interesting regime when $p(n)$ is not exponentially small we prove that the largest…

In this paper, we investigate the eigenvalue problem for a non-local dispersal operator defined on a bounded spatial domain with Neumann-type boundary conditions. Unlike the classical Laplacian, the non-local operator lacks compactness,…

Let $(E,\mathcal F,\mu)$ be a probability space, and let $P$ be a Markov operator on $L^2(\mu)$ with $1$ a simple eigenvalue such that $\mu P=\mu$ (i.e. $\mu$ is an invariant probability measure of $P$). Then $\hat P:=\ff 1 2 (P+P^*)$ has a…

We establish a sharp lower bound on the spectral gap of the biased adjacent-transposition Markov chain on the symmetric group. As a consequence, we resolve a longstanding conjecture of Fill, proving that among all regular probability…

The Linial-Meshulam complex model is a natural higher-dimensional analog of the Erd\H{o}s-R\'enyi graph model. In recent years, Linial and Peled established a limit theorem for Betti numbers of Linial-Meshulam complexes with an appropriate…

The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A(G)$. For a fixed integer $e\ge 1$, let $G^{min}_{n,n-e}$ be a graph with minimal spectral radius among all connected graphs on $n$ vertices…

We study the distribution of the minimum spacing between eigenvalues of a random n by n unitary matrix. The minimum spacing scales as $n^{-4/3}$, not $n^{-2}$ as would be the case for n independent points on the unit circle, illustrating…

We consider the ensemble of adjacency matrices of Erd\H{o}s-R\'{e}nyi random graphs, that is, graphs on $N$ vertices where every edge is chosen independently and with probability $p\equiv p(N)$. We rescale the matrix so that its bulk…

We consider the uniform random $d$-regular graph on $N$ vertices, with $d \in [N^\alpha, N^{2/3-\alpha}]$ for arbitrary $\alpha > 0$. We prove that in the bulk of the spectrum the local eigenvalue correlation functions and the distribution…

This work examines various statistical distributions in connection with random Vandermonde matrices and their extension to $d$--dimensional phase distributions. Upper and lower bound asymptotics for the maximum singular value are found to…

In this article, we derive two spectral gap bounds for the reduced Laplacian of a general simplicial complex. Our two bounds are proven by comparing a simplicial complex in two different ways with a larger complex and with the corresponding…

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…

We consider stochastic differential equations, obtained by adding weak Gaussian white noise to ordinary differential equations admitting $N$ asymptotically stable periodic orbits. We construct a discrete-time, continuous-space Markov chain,…

We consider the ensemble of $N\times N$ ($N\gg 1$) symmetric random matrices with the bimodal independent distribution of matrix elements: each element could be either "1" with the probability $p$, or "0" otherwise. We pay attention to the…

Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq3$. We prove that, with probability $1-N^{-1+{\varepsilon}}$ for any ${\varepsilon} >0$, the following two properties hold as $N…

We study the distribution of the least singular value associated to an ensemble of sparse random matrices. Our motivating example is the ensemble of $N\times N$ matrices whose entries are chosen independently from a Bernoulli distribution…

We consider a family X^{(n)}, n \in \bbN_+, of continuous-time nearest-neighbor random walks on the one dimensional lattice Z. We reduce the spectral analysis of the Markov generator of X^{(n)} with Dirichlet conditions outside (0,n) to the…

We extend the so-called "single ring theorem"[1], also known as the Haagerup-Larsen theorem[2], by showing that in the limit when the size of the matrix goes to infinity a particular correlator between left and right eigenvectors of the…