Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/418
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Rodgers, GJ | - |
dc.contributor.author | Austin, K | - |
dc.contributor.author | Kahng, B | - |
dc.contributor.author | Kim, D | - |
dc.coverage.spatial | 7 | en |
dc.date.accessioned | 2006-11-29T12:28:37Z | - |
dc.date.available | 2006-11-29T12:28:37Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Journal of Physics A: Mathematical and General, 38(43): 9431-9437(7), Oct 2005 | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/418 | - |
dc.identifier.uri | http://www.iop.org/EJ/journal/JPhysA/8 | en |
dc.description.abstract | We examine the eigenvalue spectrum, (), of the adjacency matrix of a random scale-free network with an average of p edges per vertex using the replica method. We show how in the dense limit, when p , one can obtain two relatively simple coupled equations whose solution yields () for an arbitrary complex network. For scale-free graphs, with degree distribution exponent , we obtain an exact expression for the eigenvalue spectrum when = 3 and show that () ~ 1/2-1 for large . In the limit we recover known results for the Erdös–Rényi random graph. | en |
dc.format.extent | 323987 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Institute of Physics Publishing | en |
dc.title | Eigenvalue spectra of complex networks | en |
dc.type | Research Paper | en |
dc.identifier.doi | http://dx.doi.org/10.1088/0305-4470/38/43/003 | - |
Appears in Collections: | Mathematical Physics Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Eigenvalue.pdf | 356 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.