Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSpectral Properties of Directed Random Networks with Modular Structure
137
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study spectra of directed networks with inhibitory and excitatory couplings. We investigate in particular eigenvector localization properties of various model networks for different value of correlation among their entries. Spectra of random networks, with completely uncorrelated entries show a circular distribution with delocalized eigenvectors, where as networks with correlated entries have localized eigenvectors. In order to understand the origin of localization we track the spectra as a function of connection probability and directionality. As connections are made directed, eigenstates start occurring in complex conjugate pairs and the eigenvalue distribution combined with the localization measure shows a rich pattern. Moreover, for a very well distinguished community structure, the whole spectrum is localized except few eigenstates at boundary of the circular distribution. As the network deviates from the community structure there is a sudden change in the localization property for a very small value of deformation from the perfect community structure. We search for this effect for the whole range of correlation strengths and for different community configurations. Furthermore, we investigate spectral properties of a metabolic network of zebrafish, and compare them with those of the model networks.
rate research
Read More
Although the spectra of random networks have been studied for a long time, the influence of network topology on the dense limit of network spectra remains poorly understood. By considering the configuration model of networks with four distinct degree distributions, we show that the spectral density of the adjacency matrices of dense random networks is determined by the strength of the degree fluctuations. In particular, the eigenvalue distribution of dense networks with an exponential degree distribution is governed by a simple equation, from which we uncover a logarithmic singularity in the spectral density. We also derive a relation between the fourth moment of the eigenvalue distribution and the variance of the degree distribution, which leads to a sufficient condition for the breakdown of the Wigner semicircle law for dense random networks. Based on the same relation, we propose a classification scheme of the distinct universal behaviours of the spectral density in the dense limit. Our theoretical findings should lead to important insights on the mean-field behaviour of models defined on graphs.
We derive the spectral properties of adjacency matrix of complex networks and of their Laplacian by the replica method combined with a dynamical population algorithm. By assuming the order parameter to be a product of Gaussian distributions, the present theory provides a solution for the non linear integral equations for the spectra density in random matrix theory of the spectra of sparse random matrices making a step forward with respect to the effective medium approximation (EMA) . We extend these results also to weighted networks with weight-degree correlations
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant component size do not require the assumption that networks are treelike. Our results rely only on the observation that self-similar networks possess a hierarchy of nested subgraphs whose average degree grows with their depth in the hierarchy. We conjecture that this property is pivotal for percolation in networks.
We characterize the distributions of size and duration of avalanches propagating in complex networks. By an avalanche we mean the sequence of events initiated by the externally stimulated `excitation of a network node, which may, with some probability, then stimulate subsequent firings of the nodes to which it is connected, resulting in a cascade of firings. This type of process is relevant to a wide variety of situations, including neuroscience, cascading failures on electrical power grids, and epidemology. We find that the statistics of avalanches can be characterized in terms of the largest eigenvalue and corresponding eigenvector of an appropriate adjacency matrix which encodes the structure of the network. By using mean-field analyses, previous studies of avalanches in networks have not considered the effect of network structure on the distribution of size and duration of avalanches. Our results apply to individual networks (rather than network ensembles) and provide expressions for the distributions of size and duration of avalanches starting at particular nodes in the network. These findings might find application in the analysis of branching processes in networks, such as cascading power grid failures and critical brain dynamics. In particular, our results show that some experimental signatures of critical brain dynamics (i.e., power-law distributions of size and duration of neuronal avalanches), are robust to complex underlying network topologies.
Bipartite graphs are often found to represent the connectivity between the components of many systems such as ecosystems. A bipartite graph is a set of $n$ nodes that is decomposed into two disjoint subsets, having $m$ and $n-m$ vertices each, such that there are no adjacent vertices within the same set. The connectivity between both sets, which is the relevant quantity in terms of connections, can be quantified by a parameter $alphain[0,1]$ that equals the ratio of existent adjacent pairs over the total number of possible adjacent pairs. Here, we study the spectral and localization properties of such random bipartite graphs. Specifically, within a Random Matrix Theory (RMT) approach, we identify a scaling parameter $xiequivxi(n,m,alpha)$ that fixes the localization properties of the eigenvectors of the adjacency matrices of random bipartite graphs. We also show that, when $xi<1/10$ ($xi>10$) the eigenvectors are localized (extended), whereas the localization--to--delocalization transition occurs in the interval $1/10<xi<10$. Finally, given the potential applications of our findings, we round off the study by demonstrating that for fixed $xi$, the spectral properties of our graph model are also universal.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
