Another estimation of Laplacian spectrum of the Kronecker product of graphs

DOI10.1016/J.INS.2022.07.082arXiv2102.02924OpenAlexW3126240167MaRDI QIDQ6203484FDOQ6203484

Zoran Obradovic, B. Arsić, Milan Bašić

Publication date: 27 March 2024

Published in: Information Sciences (Search for Journal in Brave)

Abstract: The relationships between eigenvalues and eigenvectors of a product graph and those of its factor graphs have been known for the standard products, while characterization of Laplacian eigenvalues and eigenvectors of the Kronecker product of graphs using the Laplacian spectra and eigenvectors of the factors turned out to be quite challenging and has remained an open problem to date. Several approaches for the estimation of Laplacian spectrum of the Kronecker product of graphs have been proposed in recent years. However, it turns out that not all the methods are practical to apply in network science models, particularly in the context of multilayer networks. Here we develop a practical and computationally efficient method to estimate Laplacian spectra of this graph product from spectral properties of their factor graphs which is more stable than the alternatives proposed in the literature. We emphasize that a median of the percentage errors of our estimated Laplacian spectrum almost coincides with the $x$-axis, unlike the alternatives which have sudden jumps at the beginning followed by a gradual decrease for the percentage errors. The percentage errors confined (confidence of the estimations) up to $pm$10% for all considered approximations, depending on a graph density. Moreover, we theoretically prove that the percentage errors becomes smaller when the network grows or the edge density level increases. Additionally, some novel theoretical results considering the exact formulas and lower bounds related to the certain correlation coefficients corresponding to the estimated eigenvectors are presented.

Full work available at URL: https://arxiv.org/abs/2102.02924

zbMATH Keywords

multilayer networksgraph miningKronecker product of graphsLaplacian eigenvalues and eigenvectorsnormalized Laplacian eigenvalues and eigenvestors

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Kronecker graphs: an approach to modeling networks
• Time series: theory and methods.
• Community structure in social and biological networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Laplacian matrices of graphs: A survey
• Estimation of Laplacian spectra of direct and strong product graphs
• On the Laplacian spectra of product graphs
• On the spectra of general random graphs
• Title not available (Why is that?)
• Graph spectra in computer science
• Gaussian conditional random fields extended for directed graphs
• Hermitian Laplacian matrix and positive of mixed graphs
• Which weighted circulant networks have perfect state transfer?
• Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
• A forgotten topological index
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hermitian normalized Laplacian matrix for directed networks

Cited In (1)

• Kronecker product of tensors and hypergraphs: structure and dynamics

This page was built for publication: Another estimation of Laplacian spectrum of the Kronecker product of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203484)