Article,

Efficient Laplacian spectral density computations for networks with arbitrary degree distributions

, , and .
Netw. Sci. (Camb. Univ. Press), 9 (3): 312--327 (September 2021)

Abstract

AbstractThe network Laplacian spectral density calculation is critical in many fields, including physics, chemistry, statistics, and mathematics. It is highly computationally intensive, limiting the analysis to small networks. Therefore, we present two efficient alternatives: one based on the network's edges and another on the degrees. The former gives the exact spectral density of locally tree-like networks but requires iterative edge-based message-passing equations. In contrast, the latter obtains an approximation of the spectral density using only the degree distribution. The computational complexities are ��(|E|log(n)) and ��(n), respectively, in contrast to ��(n3) of the diagonalization method, where n is the number of vertices and |E| is the number of edges.

Tags

    Users

    • @scadsfct

    Comments and Reviews