Relevance of the minimum degree to dynamic fluctuation in strongly heterogeneous networks
arXiv:1802.08426 · doi:10.3938/jkps.72.748
Abstract
The fluctuation of dynamic variables in complex networks is known to depend on the dimension and the heterogeneity of the substrate networks. Previous studies, however, have reported inconsistent results for the scaling behavior of fluctuation in strongly heterogeneous networks. To understand the origin of this conflict, we study the dynamic fluctuation on scale-free networks with a common small degree exponent but different mean degrees and minimum degrees constructed by using the configuration model and the static model. It turns out that the global fluctuation of dynamic variables diverges algebraically and logarithmically with the system size when the minimum degree is one and two, respectively. Such different global fluctuations are traced back to different, linear and sub-linear, growth of local fluctuation at individual nodes with their degrees, implying a crucial role of degree-one nodes in controlling correlation between distinct hubs.
arXiv comment7 pages, 5 figures
References in corpus (15)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Critical phenomena in complex networks
- Structural Vulnerability of the North American Power Grid
- Universal Behavior of Load Distribution in Scale-free Networks
- Spontaneous synchrony in power-grid networks
- Generation of uncorrelated random scale-free networks
- The origin of degree correlations in the Internet and other networks
- Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations
- Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
- Evolution of scale-free random graphs: Potts model formulation
- Intrinsic degree-correlations in static model of scale-free networks
- Discrete surface growth process as a synchronization mechanism for scale free complex networks
- Evolution equation for a model of surface relaxation in complex networks
- Fast Algorithm for Relaxation Processes in Big-data Systems