DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14202
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBandyopadhyay, Jayendra N.-
dc.date.accessioned2024-02-12T04:18:27Z-
dc.date.available2024-02-12T04:18:27Z-
dc.date.issued2006-08-
dc.identifier.urihttps://www.mis.mpg.de/publications/preprint-repository/article/2006/issue-74-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14202-
dc.description.abstractFollowing random matrix theory, we study nearest neighbor spacing distribution (NNSD) of the eigenvalues of the adjacency matrix of various model networks, namely scale-free, small-world and random networks. Our analysis shows that, though spectral densities of these model networks are different, their eigenvalue fluctuations are same and follow Gaussian orthogonal ensemble (GOE) statistics. Secondly we show the analogy between the onset of small-world behavior (quantified by small diameter and large clustering coefficients) and the transition from Poisson to GOE statistics (quantified by Brody parameter). We also present our analysis for a protein-protein interaction network in budding yeast.en_US
dc.language.isoenen_US
dc.subjectPhysicsen_US
dc.subjectStochasticityen_US
dc.subjectMatrix analysisen_US
dc.subjectComplex networksen_US
dc.titleStochasticity in Complex Networks: A random matrix analysisen_US
dc.typeArticleen_US
Appears in Collections:Department of Physics

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.