Randomness of random networks: A random matrix analysis

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/14173

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bandyopadhyay, Debashis
dc.date.accessioned	2024-02-09T11:08:23Z
dc.date.available	2024-02-09T11:08:23Z
dc.date.issued	2009-09
dc.identifier.uri	https://iopscience.iop.org/article/10.1209/0295-5075/87/48010/meta
dc.identifier.uri	http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/14173
dc.description.abstract	We 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.language.iso	en	en_US
dc.publisher	IOP	en_US
dc.subject	Physics	en_US
dc.subject	Random Matrix Theory (RMT)	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
Appears in Collections:	Department of Physics

Files in This Item:

There are no files associated with this item.