Related papers: The Limiting Eigenvalue Distribution of Iterated k…
We show that the limiting minimal eigenvalue distributions for a natural generalization of Gaussian sample-covariance structures (the "beta ensembles") are described by the spectrum of a random diffusion generator. By a Riccati…
We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…
We present a Gaussian ensemble of random cyclic matrices on the real field and study their spectral fluctuations. These cyclic matrices are shown to be pseudo-symmetric with respect to generalized parity. We calculate the joint probability…
We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic…
Randomly sampling an acyclic orientation on the complete bipartite graph $K_{n,k}$ with parts of size $n$ and $k$, we investigate the length of the longest path. We provide a probability generating function for the distribution of the…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
We consider two $n\times n$ non-Hermitian random matrices such that the $ij$th entry of one matrix is correlated with the $ij$th entry of the other matrix. However, the entries of any particular matrix are i.i.d. random variables. We study…
In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is…
We consider the limiting location and limiting distribution of the largest eigenvalue in real symmetric ($\beta$ = 1), Hermitian ($\beta$ = 2), and Hermitian self-dual ($\beta$ = 4) random matrix models with rank 1 external source. They are…
Under certain conditions on k we calculate the limit distribution of the k:th largest eigenvalue, x_k, of the Gaussian Unitary Ensemble (GUE). More specifically, if n is the dimension of a random matrix from the GUE and k is such that both…
One of the major themes of random matrix theory is that many asymptotic properties of traditionally studied distributions of random matrices are universal. We probe the edges of universality by studying the spectral properties of random…
Let $G$ be a connected graph of order $n$, and $A(G)$ and $D(G)$ its adjacency and degree diagonal matrices, respectively. For a parameter $\alpha \in [0,1]$, Nikiforov~(2017) introduced the convex combination $A_{\alpha}(G) = \alpha D(G) +…
The eigenvalue distribution is investigated for matrix models related via the localization to Chern-Simons-matter theories. An integral representation of the planar resolvent is used to derive the positions of the branch points of the…
The study of complex networks has been one of the most active fields in science in recent decades. Spectral properties of networks (or graphs that represent them) are of fundamental importance. Researchers have been investigating these…
This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods based on equitable and orbit partitions can be complex. Our…
The paper proves several limit theorems for linear eigenvalue statistics of overlapping Wigner and sample covariance matrices. It is shown that the covariance of the limiting multivariate Gaussian distribution is diagonalized by choosing…
We study eigenvalue distribution of the adjacency matrix $A^{(N,p,q)}$ of weighted random uniform $q$-hypergraphs $\Gamma= \Gamma_{N,p,q}$. We assume that the graphs have $N$ vertices and the average number of hyperedges attached to one…
We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…
We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…