Random matrix analysis of complex networks

Sarika Jalan and Jayendra N. Bandyopadhyay
Phys. Rev. E 76, 046107 – Published 12 October 2007

Abstract

We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of the adjacency matrix of various model networks, namely, random, scale-free, and small-world networks. These distributions follow the Gaussian orthogonal ensemble statistic of RMT. To probe long-range correlations in the eigenvalues we study spectral rigidity via the Δ3 statistic of RMT as well. It follows RMT prediction of linear behavior in semilogarithmic scale with the slope being 1π2. Random and scale-free networks follow RMT prediction for very large scale. A small-world network follows it for sufficiently large scale, but much less than the random and scale-free networks.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 18 March 2007

DOI:https://doi.org/10.1103/PhysRevE.76.046107

©2007 American Physical Society

Authors & Affiliations

Sarika Jalan* and Jayendra N. Bandyopadhyay

  • Max-Planck Institute for the Physics of Complex Systems, Nöthnitzerstrasse 38, D-01187 Dresden, Germany

  • *sarika@mpipks-dresden.mpg.de
  • jayendra@mpipks-dresden.mpg.de

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 76, Iss. 4 — October 2007

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×