Related papers: Sparse Random Block Matrices

We introduce a special class of random matrices (DUE) whose spectral statistics corresponds to statistics of microscopical quantities detected in vehicular flows. Comparing the level spacing distribution (for ordered eigenvalues in unfolded…

In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be…

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…

We study the statistical and dynamic properties of the systems characterized by an ultrametric space of states and translationary non-invariant symmetric transition matrices of the Parisi type subjected to "locally constant" randomization.…

We present the exact analytical expression for the spectrum of a sparse non-Hermitian random matrix ensemble, generalizing two classical results in random-matrix theory: this analytical expression forms a non-Hermitian version of the…

Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…

The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…

In this paper the question about statistical properties of block--hierarchical random matrices is raised for the first time in connection with structural characteristics of random hierarchical networks obtained by mipmapping procedure. In…

Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdos and Renyi, in particular, as well as the so-called configuration model, have served as the starting point for…

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees…

We address the construction of stable random matrix ensembles as the generalization of the stable random variables (Levy distributions). With a simple method we derive the Cauchy case, which is known to have remarkable properties. These…

We analyze the spectral distribution of symmetric random matrices with correlated entries. While we assume that the diagonals of these random matrices are stochastically independent, the elements of the diagonals are taken to be correlated.…

This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$…

The eigenvalues of quantum chaotic systems have been conjectured to follow, in the large energy limit, the statistical distribution of eigenvalues of random ensembles of matrices of size $N\rightarrow\infty$. Here we provide semiclassical…

In this paper we study the component structure of random graphs with independence between the edges. Under mild assumptions, we determine whether there is a giant component, and find its asymptotic size when it exists. We assume that the…

We investigate the spectra of adjacency matrices of multiplex networks under random matrix theory (RMT) framework. Through extensive numerical experiments, we demonstrate that upon multiplexing two random networks, the spectra of the…

We describe a method for disentangling giant component and finite cluster contributions to sparse random matrix spectra, using sparse symmetric random matrices defined on Erdos-Renyi graphs as an example and test-bed.

We investigate the random matrix configurations for two or three interacting electrons in one-dimensional disordered systems. In a suitable non-interacting localized electron basis we obtain a sparse random matrix with very long tails which…

In this article the statistical properties of symmetrical random matrices whose elements are drawn from a q-parametrized non-extensive statistics power-law distribution are investigated. In the limit as q->1 the well known Gaussian…