COLGMay 12, 2020

Estimating the Cheeger constant using machine learning

arXiv:2005.05812v1
Originality Incremental advance
AI Analysis

This work addresses graph theory and machine learning applications by providing a novel computational method for estimating the Cheeger constant, which is incremental in combining existing techniques.

The paper tackled the problem of estimating the Cheeger constant of graphs by showing it has a predominant linear dependence on the largest two eigenvalues and using a trained deep neural network as an effective estimator, achieving results that generalize from smaller to larger graphs.

In this paper, we use machine learning to show that the Cheeger constant of a connected regular graph has a predominant linear dependence on the largest two eigenvalues of the graph spectrum. We also show that a trained deep neural network on graphs of smaller sizes can be used as an effective estimator in estimating the Cheeger constant of larger graphs.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes