ﻻ يوجد ملخص باللغة العربية
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 an easy task. In this work, network spectra are interpreted as time series, and we show how their short and long-range correlations can be characterized without implementing any previous unfolding. In particular, we consider three different representations of Erdos-Renyi (ER) random networks: standard ER networks, ER networks with random-weighted self-edges, and fully random-weighted ER networks. In each case, we apply singular value decomposition (SVD) such that the spectra are decomposed in trend and fluctuation normal modes. We obtain that the fluctuation modes exhibit a clear crossover between the Poisson and the Gaussian orthogonal ensemble statistics when increasing the average degree of ER networks. Moreover, by using the trend modes, we perform a data-adaptive unfolding to calculate, for comparison purposes, traditional fluctuation measures such as the nearest neighbor spacing distribution, number variance $Sigma$2, as well as $Delta$3 and {delta}n statistics. The thorough comparison of RMT short and long-range correlation measures make us identify the SVD method as a robust tool for characterizing random network spectra.
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 ensembles of Rando
We study various properties of the vibrational normal modes for Coulomb-interacting particles in two-dimensional irregular confinement using numerical simulations. By analyzing the participation ratio and spectral statistics, we characterize the vibr
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per node can
Many real-world complex systems have small-world topology characterized by the high clustering of nodes and short path lengths.It is well-known that higher clustering drives localization while shorter path length supports delocalization of the eigenv
Characterizing the in uence of network properties on the global emerging behavior of interacting elements constitutes a central question in many areas, from physical to social sciences. In this article we study a primary model of disordered neuronal