Spectral properties of adjacency and distance matrices for various networks
arXiv:0803.2064 · doi:10.1007/978-3-540-69387-1_62
Abstract
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