Spectral properties of adjacency and distance matrices for various networks
classification
❄️ cond-mat.dis-nn
cond-mat.stat-mech
keywords
adjacencydistancegraphnetworkspropertiesspectralvariousalbert--barabasi
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.