Fundamental Limits of Deep Graph Convolutional Networks for Graph Classification

DOI10.1109/TIT.2022.3145847MaRDI QIDQ5088462zbMATH OpenOpenAlexFDO

Authors Abram Magner, Mayank Baranwal, Alfred O. III Hero

Publication date 13 July 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2022.3145847

zbMATH Keywords

distinguishabilitygraph convolutional networks (GCNs)graph representation learninggraphon pairssynthetic and real graph classification datasets

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Artificial neural networks and deep learning (68T07)

Cited in

(4)

• Pseudoinverse graph convolutional networks. Fast filters tailored for large eigengaps of dense graphs and hypergraphs
• Polynomial-based graph convolutional neural networks for graph classification
• scientific article; zbMATH DE number 7626755 (Why is no real title available?)
• Graph neural networks induced by concept lattices for classification

This page was built for publication: Fundamental Limits of Deep Graph Convolutional Networks for Graph Classification

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