arXiv · 0803.2064
Spectral properties of adjacency and distance matrices for various networks
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
K. Malarz. 2008-03-13. Spectral properties of adjacency and distance matrices for various networks. https://doi.org/10.1007/978-3-540-69387-1_62
Cite the original work for its findings. Save a collection to share your selection of sources.