DSpace Repository

Universality in complex networks: Random matrix analysis

Show simple item record

dc.contributor.author Bandyopadhyay, Jayendra N.
dc.date.accessioned 2024-02-09T10:40:40Z
dc.date.available 2024-02-09T10:40:40Z
dc.date.issued 2007-08
dc.identifier.uri https://journals.aps.org/pre/abstract/10.1103/PhysRevE.76.026109
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14167
dc.description.abstract We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world, and random networks follow universal Gaussian orthogonal ensemble statistics of random matrix theory. Second, we show an analogy between the onset of small-world behavior, quantified by the structural properties of networks, and the transition from Poisson to Gaussian orthogonal ensemble statistics, quantified by Brody parameter characterizing a spectral property. We also present our analysis for a protein-protein interaction network in budding yeast. en_US
dc.language.iso en en_US
dc.publisher APS en_US
dc.subject Physics en_US
dc.subject Matrix analysis en_US
dc.subject Network analysis en_US
dc.title Universality in complex networks: Random matrix analysis en_US
dc.type Article en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account