Spectral Properties of Adjacency and Distance Matrices for Various Networks

Authors:
Krzysztof Malarz
Affiliations:
Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, Kraków, Poland PL-30059
Venue:
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part II
Year:
2008

Citing 5
Cited 0

Introduction to algorithms

Introduction to algorithms
Topological organic chemistry. 2. Graph theory matrix determinants and eigenvalues and topological indices of alkanes

Journal of Chemical Information & Computer Sciences
Topological organic chemistry. 3.: graph theory, binary and decimal adjacency matrices and topological indices of Alkanes

Journal of Chemical Information & Computer Sciences
An introduction to econophysics: correlations and complexity in finance

An introduction to econophysics: correlations and complexity in finance
On the Spectrum and Structure of Internet Topology Graphs

IICS '02 Proceedings of the Second International Workshop on Innovative Internet Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The spectral properties of the adjacency (connectivity) and distance matrix for various types of networks: exponential, scale-free (Albert---Barabási) and classical random ones (Erdős---Rényi) are evaluated. The graph spectra for dense graph in the Erdős---Rényi model are derived analytically.