On Near Optimal Spectral Expander Graphs of Fixed Size

09/29/2021
by   Clark Alexander, et al.
0

We present a pair of heuristic algorithms. The first is to generate a random regular graph of fixed size. The second is the introduction of the Metropolis Coupled Simulated Annealer (MCSA) for optimizing spectral gaps in fixed size regular graphs.

READ FULL TEXT

page 6

page 14

page 15

page 18

research
08/26/2019

Random growth on a Ramanujan graph

The behavior of a certain random growth process is analyzed on arbitrary...
research
03/27/2020

Large independent sets on random d-regular graphs with d small

In this paper, we present a prioritized local algorithm that computes a ...
research
06/06/2023

Extremal spectral behavior of weighted random d-regular graphs

Analyzing the spectral behavior of random matrices with dependency among...
research
09/28/2018

Expander Graphs are Non-Malleable Codes

Any d-regular graph on n nodes with spectral expansion λ satisfying n = ...
research
08/26/2019

Breadth-first search on a Ramanujan graph

The behavior of the randomized breadth-first search algorithm is analyze...
research
03/16/2023

Optimizing Duplicate Size Thresholds in IDEs

In this paper, we present an approach for transferring an optimal lower ...
research
02/27/2019

Fix Your Features: Stationary and Maximally Discriminative Embeddings using Regular Polytope (Fixed Classifier) Networks

Neural networks are widely used as a model for classification in a large...

Please sign up or login with your details

Forgot password? Click here to reset