Spectral properties of adjacency and distance matrices for various networks

Simple item page
dc.creatorMalarz, K.
dc.date2008-03-13
dc.date.accessioned2026-07-07T09:47:48Z
dc.date.available2026-07-07T09:47:48Z
dc.descriptionThe 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.
dc.description9 pages, 3 figures in 7 epos files, for ICCS 2008
dc.identifierhttps://arxiv.org/abs/0803.2064
dc.identifierhttp://arxiv.org/abs/0803.2064
dc.identifierLect. Notes Comput. Sc. 5102 (2008) 559
dc.identifierdoi:10.1007/978-3-540-69387-1_62
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163977
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleSpectral properties of adjacency and distance matrices for various networks
dc.typetext

Files

Collections

arXiv