Related papers: Summing graphs for random band matrices
The parametric variation of the eigenfrequencies of a chaotic plate is measured and compared to random matrix theory using recently calculated universal correlation functions. The sensitivity of the flexural modes of the plate to pressure…
We propose a theoretical framework to study the eigenvalue spectra of the controllability Gramian of systems with random state matrices, such as networked systems with a random graph structure. Using random matrix theory, we provide…
This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…
This paper studies the asymptotic spectral properties of a renormalized sample correlation matrix, including the limiting spectral distribution, the properties of largest eigenvalues, and the central limit theorem for linear spectral…
We consider ensembles of real symmetric band matrices with entries drawn from an infinite sequence of exchangeable random variables, as far as the symmetry of the matrices permits. In general the entries of the upper triangular parts of…
In random matrix theory, the spectral distribution of the covariance matrix has been well studied under the large dimensional asymptotic regime when the dimensionality and the sample size tend to infinity at the same rate. However, most…
Random band matrices relevant for open chaotic systems are introduced and studied. The scattering model based on such matrices may serve for the description of preequilibrium chaotic scattering. In the limit of a large number of open…
The effective Hamiltonian formalism is extended to vectorial electromagnetic waves in order to describe statistical properties of the field in reverberation chambers. The latter are commonly used in electromagnetic compatibility tests. As a…
A recursive method is derived to calculate all eigenvalue correlation functions of a random hermitian matrix in the large size limit, and after smoothing of the short scale oscillations. The property that the two-point function is…
We introduce random matrix ensembles that correspond to the infinite families of irreducible Riemannian symmetric spaces of type I. In particular, we recover the Circular Orthogonal and Symplectic Ensembles of Dyson, and find other families…
We investigate a periodic quantum graph in form of a square lattice with a general self-adjoint coupling at the vertices. We analyze the spectrum, in particular, its high-energy behaviour. Depending on the coupling type, bands and gaps have…
Random matrix theory has played an important role in recent work on statistical network analysis. In this paper, we review recent results on regimes of concentration of random graphs around their expectation, showing that dense graphs…
The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…
Asymptotic properties of a vector of length power functionals of random geometric graphs are investigated. More precisely, its asymptotic covariance matrix is studied as the intensity of the underlying homogeneous Poisson point process…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
We construct a generalized transfer matrix corresponding to noninteracting tight-binding lattice models, which can subsequently be used to compute the bulk bands as well as the edge states. Crucially, our formalism works even in cases where…
Banded random matrices were introduced as a more realistic alternative to full random matrices for describing the spectral statistics of heavy nuclei. Initially considered by Wigner, they have since become a paradigmatic model for…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
Random graphs defined by an occurrence probability that is invariant under node aggregation have been identified recently in the context of network renormalization. The invariance property requires that edges are drawn with a specific…
We establish a general framework to explore parametric statistics of individual energy levels in unitary random matrix ensembles. For a generic confinement potential $W(H)$, we (i) find the joint distribution functions of the eigenvalues of…