Estimating the Cheeger constant using machine learning

05/12/2020
by   Ambar Jain, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/09/2018

Structure Entropy and Resistor Graphs

We propose the notion of resistance of a graph as an accompanying notio...
research
02/17/2020

Spectrum preserving short cycle removal on regular graphs

We describe a new method to remove short cycles on regular graphs while ...
research
09/16/2019

Explicit near-Ramanujan graphs of every degree

For every constant d ≥ 3 and ϵ > 0, we give a deterministic poly(n)-time...
research
01/09/2021

On the Seidel spectrum of threshold graphs

In this paper, we analyse spectral properties of Seidel matrix (denoted ...
research
05/22/2023

Intersection of Longest Cycle and Largest Bond in 3-Connected Graphs

A bond in a graph is a minimal nonempty edge-cut. A connected graph G is...
research
08/13/2020

On the Bipartiteness Constant and Expansion of Cayley Graphs

Let G be a finite, undirected d-regular graph and A(G) its normalized ad...
research
04/08/2021

Scaling up graph homomorphism for classification via sampling

Feature generation is an open topic of investigation in graph machine le...

Please sign up or login with your details

Forgot password? Click here to reset