Spectral properties of adjacency and distance matrices for various networks

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert--Barabasi) and classical random ones (Erdos--Renyi) are evaluated. The graph spectra for dense graph in the Erdos-Renyi model are derived analytically.
9 pages, 3 figures in 7 epos files, for ICCS 2008

Keywords

Disordered Systems and Neural Networks, Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/163977

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0803.2064
 http://arxiv.org/abs/0803.2064
 Lect. Notes Comput. Sc. 5102 (2008) 559
 doi:10.1007/978-3-540-69387-1_62

Collections

arXiv