Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNormal mode analysis of spectra of random networks
70
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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 Random Matrix Theory (RMT) the singular value decomposition (SVD) method, based on normal mode analysis, which characterizes the long-range correlations of the spectral fluctuations in a direct way without performing any unfolding. However, in the case of more general ensembles, the ergodicity property is often broken leading to ambiguities between spectrum-unfolded and ensemble-unfolded fluctuation statistics. Here, we apply SVD to a disordered random-matrix ensemble with tunable nonergodicity, as a mathematical framework to characterize the nonergodicity. We show that ensemble-averaged and individual-spectrum averaged statistics are calculated consistently using the same normal mode basis, and the nonergodicity is explained as a breakdown of this common basis.
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 vibrational modes for Coulomb clusters as localized, quasi-localized and delocalized. We also study a novel correlation function to understand the spatial structure of these different kinds of modes and subsequently extract the associated characteristic length scales. We further demonstrate that, at any given temperature, particles exhibiting larger displacement over a time interval comparable to the structural relaxation time, are strongly correlated with the low-frequency quasi-localized modes of the inherent structure corresponding to the initial configuration. Establishing this correlation for Coulomb clusters paves the path to identify the particular feature of the initial configuration that determines the previously observed heterogeneous dynamics of the particles at low temperatures in these systems.
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 be seen as graphs of random maps. We introduce an approach to investigating random maps and finding analytical results for attractors in random Boolean networks with the corresponding topology. Approximating some other non-chaotic networks to be of this class, we apply the analytic results to them. For this approximation, we observe a strikingly good agreement on the numbers of attractors of various lengths. We also investigate observables related to the average number of attractors in relation to the typical number of attractors. Here, we find strong differences that highlight the difficulties in making direct comparisons between random Boolean networks and real systems. Furthermore, we demonstrate the power of our approach by deriving some results for random maps. These results include the distribution of the number of components in random maps, along with asymptotic expansions for cumulants up to the 4th order.
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 eigenvectors of networks. Using multifractals technique, we investigate localization properties of the eigenvectors of the adjacency matrices of small-world networks constructed using Watts-Strogatz algorithm. We find that the central part of the eigenvalue spectrum is characterized by strong multifractality whereas the tail part of the spectrum have Dq->1. Before the onset of the small-world transition, an increase in the random connections leads to an enhancement in the eigenvectors localization, whereas just after the onset, the eigenvectors show a gradual decrease in the localization. We have verified an existence of sharp change in the correlation dimension at the localization-delocalization transition
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 networks with excitatory-inhibitory structure and balance constraints. We show how the interplay between structure and disorder in the connectivity leads to a universal transition from trivial to synchronized stationary or periodic states. This transition cannot be explained only through the analysis of the spectral density of the connectivity matrix. We provide a low dimensional approximation that shows the role of both the structure and disorder in the dynamics.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
