Related papers: Disordered ensembles of random matrices
We consider the ensemble of adjacency matrices of Erd{\H o}s-R\'enyi random graphs, i.e.\ 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…
Randomized network ensembles are the null models of real networks and are extensivelly used to compare a real system to a null hypothesis. In this paper we study network ensembles with the same degree distribution, the same…
We describe a method to extract from experimental data the important dynamical modes in spatio-temporal patterns in a system driven out of thermodynamic equilibrium. Using a novel optical technique for controlling fluid flow, we create an…
A family of random matrix ensembles interpolating between the GUE and the Ginibre ensemble of $n\times n$ matrices with iid centered complex Gaussian entries is considered. The asymptotic spectral distribution in these models is uniform in…
The Gram-Schmidt process of L.N. Vaserstein for making an elementary matrix symplectic yields a nice set of generators for the odd sized elementary group.
We use random matrix theory to study the statistics of wave transport in one-dimensional random media with Levy disorder, in which waves perform Levy flights.
The distribution of the ratios of consecutive eigenvalue spacings of random matrices has emerged as an important tool to study spectral properties of many-body systems. This article numerically investigates the eigenvalue ratios…
In this paper we present a new local L\'evy Central Limit Theorem, showing convergence to stable states that are not necessarily the Gaussian, and use it to find new and intuitive entropically chaotic families with underlying one-particle…
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…
In this work, we study the generalized sorting problem, where we are given a set of $n$ elements to be sorted, but only a subset of all possible pairwise element comparisons is allowed. We look at the problem from the perspective of the…
Using a matrix product method the steady-state of a family of disordered reaction-diffusion systems consisting of different species of interacting classical particles moving on a lattice with periodic boundary conditions is studied. A new…
In the past we have considered Gaussian random matrix ensembles in the presence of an external matrix source. The reason was that it allowed, through an appropriate tuning of the eigenvalues of the source, to obtain results on non-trivial…
Ensemble models of graphs are one of the most important theoretical tools to study complex networks. Among them, exponential random graphs (ERGs) have proven to be very useful in the analysis of social networks. In this paper we develop a…
The random graph of Erdos and Renyi is one of the oldest and best studied models of a network, and possesses the considerable advantage of being exactly solvable for many of its average properties. However, as a model of real-world networks…
Using operator methods, we generally present the level densities for kinds of random matrix unitary ensembles in weak sense. As a corollary, the limit spectral distributions of random matrices from Gaussian, Laguerre and Jacobi unitary…
We consider the adjacency matrix of the ensemble of Erd\H{o}s-R\'enyi random graphs which consists of graphs on $N$ vertices in which each edge occurs independently with probability $p$. We prove that in the regime $pN \gg 1$ these matrices…
Networks generated from Voronoi tessellations of space are prototypes for topologically disordered systems. In order to assess the effects of random coordination on the statistical properties of energy spectra, we analyze tight-binding…
We investigate a method of generating a graph $G=(V,E)$ out of an ordered list of $n$ distinct real numbers $a_1, \dots, a_n$. These graphs can be used to test for the presence of interesting structure in the sequence. We describe sequences…
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edges are far from independent, and to prove several results…
Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks, exponential random graph models are a…