论文信息 - Performance Evaluations of Graph Spectra on Evolving Systems

Performance Evaluations of Graph Spectra on Evolving Systems

Evolving complex networks are abundant in the real world, i.e., Networks with different sizes (number of nodes) may originate from the same evolving system. In this paper, we use some typical evolving models of complex networks to evaluate the performances of graph spectra. The experimental results verify that the normalized Laplacian spectrum is a good indicator to distinguish between different evolving systems.

[1] G. J. Rodgers,et al. Local rewiring rules for evolving complex networks , 2014, ArXiv.

[2] Xiaofan Wang,et al. A new community-based evolving network model , 2007 .

[3] Jure Leskovec,et al. {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .

[4] James P. G. Sterbenz,et al. Topology connectivity analysis of internet infrastructure using graph spectra , 2012, 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems.

[5] Mauricio Barahona,et al. Robustness of regular ring lattices based on natural connectivity , 2011, Int. J. Syst. Sci..

[6] Anirban Banerjee,et al. Spectral Characterization of Network Structures and Dynamics , 2009 .

[7] Meifeng Dai,et al. Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks , 2014 .

[8] Ye Xu,et al. Approaches in Evaluations of Internet Topology Modeling , 2010, 2010 Second International Workshop on Education Technology and Computer Science.

[9] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.