Spectral properties of adjacency and distance matrices for various networks
Disordered Systems and Neural Networks
2008-07-03 v1 Statistical Mechanics
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.
Keywords
Cite
@article{arxiv.0803.2064,
title = {Spectral properties of adjacency and distance matrices for various networks},
author = {K. Malarz},
journal= {arXiv preprint arXiv:0803.2064},
year = {2008}
}
Comments
9 pages, 3 figures in 7 epos files, for ICCS 2008