# Spectral properties of adjacency and distance matrices for various networks

Source: [Spectral properties of adjacency and distance matrices for various networks](<https://www.sota2.com/research/paper/68fa219e7a2b558e29338360>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-28T13:52:16.075Z

Authors: K. Malarz

Published: 2008-03-13T23:19:19.000Z

## 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/0803.2064>)

[PDF](<https://arxiv.org/pdf/0803.2064.pdf>)