Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
From MaRDI portal
Publication:5158912
DOI10.1088/1742-5468/ac21d3OpenAlexW3133889743MaRDI QIDQ5158912
Romain Couillet, Lorenzo Dall'Amico, Nicolas Tremblay
Publication date: 26 October 2021
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.03561
machine learningrandom matrix theory and extensionsclustering techniquesinference of graphical models
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correlation clustering
- On the distribution of the roots of certain symmetric matrices
- Norms and exclusion theorems
- Strong-disorder paramagnetic-ferromagnetic fixed point in the square-lattice \(\pm J\) Ising model
- Non-backtracking PageRank: from the classic model to Hashimoto matrices
- Spectral redemption in clustering sparse networks
- New Graph Polynomials from the Bethe Approximation of the Ising Partition Function
- Emergence of Scaling in Random Networks
- Graphical Models, Exponential Families, and Variational Inference
- Information, Physics, and Computation
- The Nishimori line and Bayesian statistics
- Statistical Physics of Spin Glasses and Information Processing
- Spectral Method for Phase Retrieval: An Expectation Propagation Perspective
- Weighted community detection and data clustering using message passing
- Beyond non-backtracking: non-cycling network centrality measures
- Optimal Spectral Initialization for Signal Recovery With Applications to Phase Retrieval
- A matrix-weighted zeta function of a graph
This page was built for publication: Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs