DSpace Repository

Stochasticity in Complex Networks: A random matrix analysis

Show simple item record

dc.contributor.author Bandyopadhyay, Jayendra N.
dc.date.accessioned 2024-02-12T04:18:27Z
dc.date.available 2024-02-12T04:18:27Z
dc.date.issued 2006-08
dc.identifier.uri https://www.mis.mpg.de/publications/preprint-repository/article/2006/issue-74
dc.identifier.uri http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14202
dc.description.abstract Following 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.iso en en_US
dc.subject Physics en_US
dc.subject Stochasticity en_US
dc.subject Matrix analysis en_US
dc.subject Complex networks en_US
dc.title Stochasticity in Complex Networks: A 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