Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/4549
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRodgers, G J-
dc.contributor.authorNagao, T-
dc.date.accessioned2010-10-04T13:11:57Z-
dc.date.available2010-10-04T13:11:57Z-
dc.date.issued2010-
dc.identifier.citationTo appear in Akemann G, Baik J, Di Francesco P. (eds.), Oxford Handbook of Random Matrix Theory, published by Oxford University Press-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/4549-
dc.description.abstractThis chapter contains a brief introduction to complex networks, and in particular to small world and scale free networks. We show how to apply the replica method developed to analyse random matrices in statistical physics to calculate the spectral densities of the adjacency and Laplacian matrices of a scale free network. We use the effective medium approximation to treat networks with finite mean degree and discuss the local properties of random matrices associated with complex networks.en_US
dc.language.isoenen_US
dc.titleComplex networksen_US
dc.typeBook Chapteren_US
Appears in Collections:Dept of Mathematics Research Papers
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
Fulltext.pdf120.8 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.