Mean-field theory of graph neural networks in graph partitioning

DOI10.1088/1742-5468/ab3456zbMath1459.05319arXiv1810.11908OpenAlexW2889833989MaRDI QIDQ5854107

Tomoyuki Obuchi, Tatsuro Kawamoto, Masashi Tsubaki

Publication date: 16 March 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Applications of graph theory (05C90) Neural networks for/in biological studies, artificial life and related topics (92B20) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Uses Software

• k-means++
• Adam
• Chainer
• node2vec

Cites Work

• Reconstruction and estimation in the planted partition model
• Spectral clustering and the high-dimensional stochastic blockmodel
• Spectral redemption in clustering sparse networks
• A theory of solving TAP equations for Ising models with general invariant random matrices
• Estimation and Prediction for Stochastic Blockstructures
• The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
• Community detection thresholds and the weak Ramanujan property
• Learning representations by back-propagating errors
• Unnamed Item

This page was built for publication: Mean-field theory of graph neural networks in graph partitioning