DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/14201
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBandyopadhyay, Jayendra N.-
dc.date.accessioned2024-02-12T04:08:39Z-
dc.date.available2024-02-12T04:08:39Z-
dc.date.issued2009-08-
dc.identifier.urihttps://www.sciengine.com/EPL/doi/10.1209/0295-5075/87/48010;JSESSIONID=e95c3422-bafb-4c44-aad2-146734ce3d2a-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14201-
dc.description.abstractWe analyze complex networks under the random matrix theory framework. Particularly, we show that statistics, which gives information about the long-range correlations among eigenvalues, provides a measure of randomness in networks. As networks deviate from the regular structure, follows the random matrix prediction of logarithmic behavior (i.e., ) for longer scale.en_US
dc.language.isoenen_US
dc.publisherSci Egngineen_US
dc.subjectPhysicsen_US
dc.subjectMatrix analysisen_US
dc.subjectRandom networksen_US
dc.titleRandomness of random 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.