Spectral transitions in networks

Details Spectral transitions in networks Spectral transitions in networks

2007-01-04

arxiv.org/abs/physics/0701054v1

New J. Phys. 8 307 (2006)

Physics

Data Analysis, Statistics and Probability

11 pages, 5 figures

Scientific paper

10.1088/1367-2630/8/12/307

We study the level spacing distribution p(s) in the spectrum of random networks. According to our numerical results, the shape of p(s) in the Erdos-Renyi (E-R) random graph is determined by the average degree , and p(s) undergoes a dramatic change when is varied around the critical point of the percolation transition, =1. When > 1, the p(s) is described by the statistics of the Gaussian Orthogonal Ensemble (GOE), one of the major statistical ensembles in Random Matrix Theory, whereas at =1 it follows the Poisson level spacing distribution. Closely above the critical point, p(s) can be described in terms of an intermediate distribution between Poisson and the GOE, the Brody-distribution. Furthermore, below the critical point p(s) can be given with the help of the regularised Gamma-function. Motivated by these results, we analyse the behaviour of p(s) in real networks such as the Internet, a word association network and a protein protein interaction network as well. When the giant component of these networks is destroyed in a node deletion process simulating the networks subjected to intentional attack, their level spacing distribution undergoes a similar transition to that of the E-R graph.

Affiliated with

Also associated with

No associations

Rating

Spectral transitions in networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Spectral transitions in networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Spectral transitions in networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-310619