Related papers: Random Matrix Analysis of Multiplex Networks
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…
We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes…
We investigate the local spectral statistics of the loss surface Hessians of artificial neural networks, where we discover excellent agreement with Gaussian Orthogonal Ensemble statistics across several network architectures and datasets.…
Multiplex networks are collections of networks with identical nodes but distinct layers of edges. They are genuine representations for a large variety of real systems whose elements interact in multiple fashions or flavors. However,…
Latent space models are frequently used for modeling single-layer networks and include many popular special cases, such as the stochastic block model and the random dot product graph. However, they are not well-developed for more complex…
A new class of Random Matrix Ensembles is introduced. The Gaussian orthogonal, unitary, and symplectic ensembles GOE, GUE, and GSE, of random matrices are analogous to the classical Gibbs ensemble governed by Boltzmann's distribution in the…
The traffic behavior of University of Louisville network with the interconnected backbone routers and the number of Virtual Local Area Network (VLAN) subnets is investigated using the Random Matrix Theory (RMT) approach. We employ the…
We introduce a model for the randomization of complex networks with geometric structure. The geometric randomization (GR) model assumes a homogeneous distribution of the nodes in an underlying similarity space and uses rewirings of the…
Several spectral fluctuation measures of random matrix theory (RMT) have been applied in the study of spectral properties of networks. However, the calculation of those statistics requires performing an unfolding procedure, which may not be…
Probabilistic graphical models with frustration exhibit rugged energy landscapes that trap iterative optimization dynamics. These landscapes are shaped not only by local interactions, but crucially also by the global loop structure of the…
We introduce a methodology based on averaging similarity matrices with the aim of integrating the layers of a multiplex network into a single monoplex network. Multiplex networks are adopted for modelling a wide variety of real-world…
Tensor models play an increasingly prominent role in many fields, notably in machine learning. In several applications, such as community detection, topic modeling and Gaussian mixture learning, one must estimate a low-rank signal from a…
As wireless communication applications evolve from traditional multipath environments to high-mobility scenarios like unmanned aerial vehicles, multiplexing techniques have advanced accordingly. Traditional single-carrier frequency-domain…
Random Matrix Theory (RMT) has successfully modeled diverse systems, from energy levels of heavy nuclei to zeros of $L$-functions; this correspondence has allowed RMT to successfully predict many number theoretic behaviors. However there…
In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key instrument for modeling large-scale complex systems, due to…
Generation of realistic topologies plays an important role in determining the accuracy and validity of simulation studies. This study presents a discussion to justify why, and how often randomly generated adjacency matrices may not not…
In the last decade there has been increasing interest in the fields of random matrices, interacting particle systems, stochastic growth models, and the connections between these areas. For instance, several objects appearing in the limit of…
We study the averaging-based distributed optimization solvers over random networks. We show a general result on the convergence of such schemes using weight-matrices that are row-stochastic almost surely and column-stochastic in expectation…
We introduce a random matrix framework for studying statistical-mechanical lattice systems through spectral observables. Equilibrium configurations sampled from a Boltzmann measure are mapped to matrix ensembles whose covariance structure…
In this work we use the random matrix theory (RMT) to correctly describethe behavior of spectral statistical properties of the sea surface temperatureof oceans. This oceanographic variable plays an important role in theglobalclimate system.…