Related papers: Spectra of sparse non-Hermitian random matrices: a…
It has been observed that an interesting class of non-Gaussian stationary processes is obtained when in the harmonics of a signal with random amplitudes and phases, frequencies can also vary randomly. In the resulting models, the…
The spectral density of various ensembles of sparse symmetric random matrices is analyzed using the cavity method. We consider two cases: matrices whose associated graphs are locally tree-like, and sparse covariance matrices. We derive a…
We present experimental and theoretical results for the fluctuation properties in the incomplete spectra of quantum systems with symplectic symmetry and a chaotic dynamics in the classical limit. To obtain theoretical predictions, we extend…
We study asymptotic behaviour of the correlation functions of bipartite sparse random $N\times N$ matrices. We assume that the graphs have $N$ vertices, the ratio of parts is $\displaystyle\frac{\alpha}{1-\alpha}$ and the average number of…
We determine statistical and computational limits for estimation of a rank-one matrix (the spike) corrupted by an additive gaussian noise matrix, in a sparse limit, where the underlying hidden vector (that constructs the rank-one matrix)…
A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\sum_i g_i A_i$ where $g_i$ are independent…
We apply Tsallis's q-indexed nonextensive entropy to formulate a random matrix theory (RMT), which may be suitable for systems with mixed regular-chaotic dynamics. We consider the super-extensive regime of q < 1. We obtain analytical…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of…
We investigate traces of powers of random matrices whose distributions are invariant under rotations (with respect to the Hilbert--Schmidt inner product) within a real-linear subspace of the space of $n\times n$ matrices. The matrices we…
We focus on \emph{row sampling} based approximations for matrix algorithms, in particular matrix multipication, sparse matrix reconstruction, and \math{\ell_2} regression. For \math{\matA\in\R^{m\times d}} (\math{m} points in \math{d\ll m}…
The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…
Graphs arising in statistical problems, signal processing, large networks, combinatorial optimization, and data analysis are often dense, which causes both computational and storage bottlenecks. One way of \textit{sparsifying} a…
Kolo\u{g}lu, Kopp and Miller compute the limiting spectral distribution of a certain class of real random matrix ensembles, known as $k$-block circulant ensembles, and discover that it is exactly equal to the eigenvalue distribution of an…
We propose a family of exactly solvable quasiperiodic lattice models with analytical complex mobility edges, which can incorporate mosaic modulations as a straightforward generalization. By sweeping a potential tuning parameter $\delta$, we…
We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random. These matrices have a one-to-one correspondence with the adjacency…
We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments indicate that the level spacing distribution of a generic k-regular graph approaches that of the Gaussian Orthogonal Ensemble of random matrix…
We consider single-source shortest path algorithms that perform a sequence of relaxation steps whose ordering depends only on the input graph structure and not on its weights or the results of prior steps. Each step examines one edge of the…
We study random graphs with possibly different edge probabilities in the challenging sparse regime of bounded expected degrees. Unlike in the dense case, neither the graph adjacency matrix nor its Laplacian concentrate around their…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…