Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs

03/05/2021
by   Lorenzo Dall'Amico, et al.
0

This article unveils a new relation between the Nishimori temperature parametrizing a distribution P and the Bethe free energy on random Erdos-Renyi graphs with edge weights distributed according to P. Estimating the Nishimori temperature being a task of major importance in Bayesian inference problems, as a practical corollary of this new relation, a numerical method is proposed to accurately estimate the Nishimori temperature from the eigenvalues of the Bethe Hessian matrix of the weighted graph. The algorithm, in turn, is used to propose a new spectral method for node classification in weighted (possibly sparse) graphs. The superiority of the method over competing state-of-the-art approaches is demonstrated both through theoretical arguments and real-world data experiments.

READ FULL TEXT

page 14

page 22

research
02/09/2023

SF-SGL: Solver-Free Spectral Graph Learning from Linear Measurements

This work introduces a highly-scalable spectral graph densification fram...
research
07/20/2019

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model

Graph matching aims at finding the vertex correspondence between two unl...
research
05/10/2022

On equipathenergetic graphs and new bounds on path energy

The path eigenvalues of a graph G are the eigenvalues of its path matrix...
research
09/15/2021

Accurately Modeling Biased Random Walks on Weighted Graphs Using Node2vec+

Node embedding is a powerful approach for representing the structural ro...
research
09/28/2018

Weighted Spectral Embedding of Graphs

We present a novel spectral embedding of graphs that incorporates weight...
research
06/04/2019

Sparse Representation Classification via Screening for Graphs

The sparse representation classifier (SRC) is shown to work well for ima...

Please sign up or login with your details

Forgot password? Click here to reset