Related papers: Disordered ensembles of random matrices
Using the simple procedure, recently introduced, of dividing Gaussian matrices by a positive random variable, a family of random matrices is generated characterized by a behavior ruled by the generalized hyperbolic distribution. The…
Using the Generalized Maximium Entropy Principle based on the nonextensive q entropy a new family of random matrix ensembles is generated. This family unifies previous extensions of Random Matrix Theory and gives rise to an orthogonal…
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…
The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…
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…
Composed ensembles of random unitary matrices are defined via products of matrices, each pertaining to a given canonical circular ensemble of Dyson. We investigate statistical properties of spectra of some composed ensembles and demonstrate…
Using the theory of free random variables (FRV) and the Coulomb gas analogy, we construct stable random matrix ensembles that are random matrix generalizations of the classical one-dimensional stable L\'{e}vy distributions. We show that the…
A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…
We study an ensemble of random matrices (the Rosenzweig-Porter model) which, in contrast to the standard Gaussian ensemble, is not invariant under changes of basis. We show that a rather complete understanding of its level correlations can…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…
This paper is a direct continuation of an earlier work, where we studied Erd\"os-R\'enyi random graphs perturbed by an interaction Hamiltonian favouring the formation of short cycles. Here, we generalize these results. We keep the same…
Exponential Random Graph Models (ERGM) behave peculiar in large networks with thousand(s) of actors (nodes). Standard models containing two-star or triangle counts as statistics are often unstable leading to completely full or empty…
Random matrix models of disordered bosons consist of matrices in the Lie algebra g=sp_n(R). Assuming dynamical stability, their eigenvalues are required to be purely imaginary. Here a method is proposed for constructing ensembles (E,P) of…
The statistics of random-matrix spectra can be very sensitive to the unfolding procedure that separates global from local properties. In order to avoid the introduction of possible artifacts, recently it has been applied to ergodic…
In this paper we consider an extension of the Rosenzweig-Porter (RP) model, the L\'evy-RP (L-RP) model, in which the off-diagonal matrix elements are broadly distributed, providing a more realistic benchmark to develop an effective…
An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…
Theory of Random Matrix Ensembles have proven to be a useful tool in the study of the statistical distribution of energy or transmission levels of a wide variety of physical systems. We give an overview of certain q-generalizations of the…
We prove that independent families of permutation invariant random matrices are asymptotically free over the diagonal, both in probability and in expectation, under a uniform boundedness assumption on the operator norm. We can relax the…
The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random…
The problem of defining a statistical ensemble of random graphs with an arbitrary connectivity distribution is discussed. Introducing such an ensemble is a step towards uderstanding the geometry of wide classes of graphs independently of…