Another estimation of Laplacian spectrum of the Kronecker product of graphs

02/04/2021
by   Milan Bašić, et al.
0

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 ±10 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/08/2019

On Laplacian spectrum of dendrite trees

For dendrite graphs from biological experiments on mouse's retinal gangl...
research
09/02/2019

Further results on structured regression for multi-scale networks

Gaussian Conditional Random Fields (GCRF), as a structured regression mo...
research
05/15/2023

Numerical spectra of the Laplacian for line bundles on Calabi-Yau hypersurfaces

We give the first numerical calculation of the spectrum of the Laplacian...
research
02/27/2020

Edge corona product as an approach to modeling complex simplical networks

Many graph products have been applied to generate complex networks with ...
research
12/15/2020

Product Graph Learning from Multi-domain Data with Sparsity and Rank Constraints

In this paper, we focus on learning product graphs from multi-domain dat...
research
09/03/2022

Discontinuities of the Integrated Density of States for Laplacians Associated with Penrose and Ammann-Beenker Tilings

Aperiodic substitution tilings provide popular models for quasicrystals,...
research
03/15/2023

Joint Graph and Vertex Importance Learning

In this paper, we explore the topic of graph learning from the perspecti...

Please sign up or login with your details

Forgot password? Click here to reset