The Laplacian Spectrum of Large Graphs Sampled from Graphons - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Network Science and Engineering Year : 2021

The Laplacian Spectrum of Large Graphs Sampled from Graphons

(1, 2) , (2) , (2)
1
2

Abstract

This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively approximated by using the degree function of the corresponding graphon. More specifically, we show how to approximate the distribution of the Laplacian eigenvalues and the average effective resistance (Kirchhoff index) of the graph. For all cases, we provide explicit bounds on the approximation errors and derive the asymptotic rates at which the errors go to zero when the number of nodes goes to infinity. Our main results are proved under the conditions that the graphon is piecewise Lipschitz and bounded away from zero.
Fichier principal
Vignette du fichier
The Laplacian Spectrum of Large Graphs Sampled from Graphons.pdf (1.85 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03197046 , version 1 (13-04-2021)

Identifiers

Cite

Renato Vizuete, Federica Garin, Paolo Frasca. The Laplacian Spectrum of Large Graphs Sampled from Graphons. IEEE Transactions on Network Science and Engineering, 2021, 8 (2), pp.1711-1721. ⟨10.1109/TNSE.2021.3069675⟩. ⟨hal-03197046⟩
103 View
57 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More