Approximating the Largest Eigenvalue of the Modified Adjacency Matrix of Networks with Heterogeneous Node Biases
arXiv:0902.1465 · doi:10.1103/PhysRevE.79.056111
Abstract
Motivated by its relevance to various types of dynamical behavior of network systems, the maximum eigenvalue of the adjacency matrix of a network has been considered, and mean-field-type approximations to have been developed for different kinds of networks. Here is defined by () if there is (is not) a directed network link to from . However, in at least two recent problems involving networks with heterogeneous node properties (percolation on a directed network and the stability of Boolean models of gene networks), an analogous but different eigenvalue problem arises, namely, that of finding the largest eigenvalue of the matrix , where and the `bias' may be different at each node . (In the previously mentioned percolation and gene network contexts, is a probability and so lies in the range .) The purposes of this paper are to extend the previous considerations of the maximum eigenvalue of to , to develop suitable analytic approximations to , and to test these approximations with numerical experiments. In particular, three issues considered are (i) the effect of the correlation (or anticorrelation) between the value of and the number of links to and from node ; (ii) the effect of correlation between the properties of two nodes at either end of a network link (`assortativity'); and (iii) the effect of community structure allowing for a situation in which different -values are associated with different communities.
15 pages, 3 figures
References in corpus (6)
- The onset of synchronization in large networks of coupled oscillators
- Resilience to damage of graphs with degree correlations
- Approximating the largest eigenvalue of network adjacency matrices
- The effect of network topology on the stability of discrete state models of genetic control
- Weighted percolation on directed networks
- The emergence of coherence in complex networks of heterogeneous dynamical systems
Cited by in corpus (6)
- Predicting criticality and dynamic range in complex networks: effects of topology
- Approximating Spectral Impact of Structural Perturbations in Large Networks
- Stability of Boolean networks: The joint effects of topology and update rules
- Optimal Stabilization of Boolean Networks through Collective Influence
- Random subshifts of finite type
- Network Extreme Eigenvalue - from Multimodal to Scale-free Network