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

03/27/2020
by   Raffaele Marino, et al.
0

In this paper, we present a prioritized local algorithm that computes a maximal independent set on a random d-regular graph with small and fixed connectivity d. Combining different strategies, we compute new lower bounds on the independence ratio ∀ d ∈ [5,100], d∈N. All the new bounds improve upon the best previous bounds. Moreover, for independent set in random 3-regular graph, we experimentally extrapolate, by finite-size analysis, the asymptotic value of the independence ratio at α_LB=0.445327.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2022

Move Complexity of a Self-Stabilizing Algorithm for Maximal Independent Sets

A_𝖽𝖾𝗀 is a self-stabilizing algorithm that computes a maximal independen...
research
07/10/2022

Large independent sets in Markov random graphs

Computing the maximum size of an independent set in a graph is a famousl...
research
09/29/2021

On Near Optimal Spectral Expander Graphs of Fixed Size

We present a pair of heuristic algorithms. The first is to generate a ra...
research
11/06/2022

On Vertex Bisection Width of Random d-Regular Graphs

Vertex bisection is a graph partitioning problem in which the aim is to ...
research
09/30/2020

Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs

Computing the size of maximum independent sets is a NP-hard problem for ...
research
04/18/2020

Hidden independence in unstructured probabilistic models

We describe a novel way to represent the probability distribution of a r...
research
08/27/2020

Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs

We study the problem of efficiently refuting the k-colorability of a gra...

Please sign up or login with your details

Forgot password? Click here to reset