Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
A. N. Samukhin, S. N. Dorogovtsev, J. F. F. Mendes

TL;DR
This paper analyzes the Laplacian spectra of uncorrelated random networks to understand signal propagation and random walks, revealing that the minimum degree is crucial and that scale-free degree distributions are less important.
Contribution
The authors develop an exact integral equation approach to describe Laplacian spectra and dynamics on uncorrelated networks, emphasizing the role of minimum degree over degree distribution.
Findings
The spectral edge depends on the minimum degree q_m.
Signal propagation resembles a Gaussian broadening over time.
Spectral density near the edge is characterized analytically.
Abstract
We study the Laplacian operator of an uncorrelated random network and, as an application, consider hopping processes (diffusion, random walks, signal propagation, etc.) on networks. We develop a strict approach to these problems. We derive an exact closed set of integral equations, which provide the averages of the Laplacian operator's resolvent. This enables us to describe the propagation of a signal and random walks on the network. We show that the determining parameter in this problem is the minimum degree of vertices in the network and that the high-degree part of the degree distribution is not that essential. The position of the lower edge of the Laplacian spectrum appears to be the same as in the regular Bethe lattice with the coordination number . Namely, if , and if . In both these cases the density of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
