dc.contributor.author |
Bandyopadhyay, Jayendra N. |
|
dc.date.accessioned |
2024-02-12T04:08:39Z |
|
dc.date.available |
2024-02-12T04:08:39Z |
|
dc.date.issued |
2009-08 |
|
dc.identifier.uri |
https://www.sciengine.com/EPL/doi/10.1209/0295-5075/87/48010;JSESSIONID=e95c3422-bafb-4c44-aad2-146734ce3d2a |
|
dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14201 |
|
dc.description.abstract |
We 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.iso |
en |
en_US |
dc.publisher |
Sci Egngine |
en_US |
dc.subject |
Physics |
en_US |
dc.subject |
Matrix analysis |
en_US |
dc.subject |
Random networks |
en_US |
dc.title |
Randomness of random networks: A random matrix analysis |
en_US |
dc.type |
Article |
en_US |