Randomness of random networks: A random matrix analysis

dc.contributor.authorBandyopadhyay, Debashis
dc.date.accessioned2024-02-09T11:08:23Z
dc.date.available2024-02-09T11:08:23Z
dc.date.issued2009-09
dc.description.abstractWe analyze complex networks under the random matrix theory framework. Particularly, we show that Δ3 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, Δ3 follows the random matrix prediction of logarithmic behavior (i.e., ) for longer scale.en_US
dc.identifier.urihttps://iopscience.iop.org/article/10.1209/0295-5075/87/48010/meta
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14173
dc.language.isoenen_US
dc.publisherIOPen_US
dc.subjectPhysicsen_US
dc.subjectRandom Matrix Theory (RMT)en_US
dc.subjectRandom networksen_US
dc.titleRandomness of random networks: A random matrix analysisen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: