Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs

We introduce a general class of algorithms and analyse their application to regular graphs of large girth. In particular, we can transfer several results proved for random regular graphs into (deterministic) results about all regular graphs with sufficiently large girth. This reverses the usual direction, which is from the deterministic setting to the random one. In particular, this approach enables, for the first time, the achievement of results equivalent to those obtained on random regular graphs by a powerful class of algorithms which contain prioritised actions. As a result, we obtain new upper or lower bounds on the size of maximum independent sets, minimum dominating sets, maximum k-independent sets, minimum k-dominating sets and maximum k-separated matchings in r-regular graphs with large girth.

[1]  Bernard Mans,et al.  Connected domination of regular graphs , 2009, Discret. Math..

[2]  B. Szegedy,et al.  Limits of locally–globally convergent graph sequences , 2014 .

[3]  B. Szegedy,et al.  Limits of local-global convergent graph sequences , 2012, 1205.4356.

[4]  Nicholas C. Wormald,et al.  Colouring Random 4-Regular Graphs , 2007, Combinatorics, Probability and Computing.

[5]  G. Hopkins,et al.  Girth and Independence Ratio , 1982, Canadian Mathematical Bulletin.

[6]  Paul A. Catlin.  A bound on the chromatic number of a graph , 1978, Discret. Math..

[7]  William Duckworth,et al.  Large independent sets in random regular graphs , 2009, Theor. Comput. Sci..

[8]  Ken-ichi Kawarabayashi,et al.  Domination in a graph with a 2-factor , 2006, J. Graph Theory.

[9]  Alexandr V. Kostochka,et al.  On an upper bound of a graph's chromatic number, depending on the graph's degree and density , 1977, J. Comb. Theory B.

[10]  Bruce A. Reed.  Paths, Stars and the Number Three , 1996, Comb. Probab. Comput..

[11]  Witold Hurewicz,et al.  Lectures on Ordinary Differential Equations , 1959 .

[12]  David Gamarnik,et al.  Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections , 2008, Combinatorics, Probability and Computing.

[13]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[14]  William Duckworth,et al.  On the Independent Domination Number of Random Regular Graphs , 2006, Combinatorics, Probability and Computing.

[15]  Ondrej Zýka.  On the bipartite density of regular graphs with large girth , 1990, J. Graph Theory.

[16]  N. Wormald.  The differential equation method for random graph processes and greedy algorithms , 1999 .

[17]  Nicholas C. Wormald,et al.  Induced Forests in Regular Graphs with Large Girth , 2008, Comb. Probab. Comput..

[18]  Burkhard Monien,et al.  Upper bounds on the bisection width of 3- and 4-regular graphs , 2006, J. Discrete Algorithms.

[19]  Jim Lawrence.  Covering the vertex set of a graph with subgraphs of smaller degree , 1978, Discret. Math..

[20]  Maria J. Serna,et al.  Bounds on the max and min bisection of random cubic and random 4-regular graphs , 2003, Theor. Comput. Sci..

[21]  Nicholas C. Wormald,et al.  Large independent sets in regular graphs of large girth , 2007, J. Comb. Theory, Ser. B.

[22]  N. Wormald,et al.  Models of the , 2010 .

[23]  Nicholas C. Wormald,et al.  Random graphs and asymptotics , 2004 .

[24]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[25]  Carlos Hoppen,et al.  Properties of regular graphs with large girth via local algorithms , 2016, J. Comb. Theory, Ser. B.

[26]  Béla Bollobás,et al.  Random Graphs , 1985 .

[27]  Jan Volec,et al.  Maximum edge‐cuts in cubic graphs with large girth and in random cubic graphs , 2011, Random Struct. Algorithms.

[28]  Dieter Rautenbach,et al.  Domination in Graphs of Minimum Degree at least Two and Large Girth , 2008, Graphs Comb..

[29]  Nicholas C. Wormald,et al.  Analysis of greedy algorithms on graphs with bounded degrees , 2003, Discret. Math..

[30]  James B. Shearer.  A note on the independence number of triangle-free graphs, II , 1991, J. Comb. Theory, Ser. B.

[31]  William Duckworth,et al.  Minimum independent dominating sets of random cubic graphs , 2002, Random Struct. Algorithms.

[32]  Sanming Zhou,et al.  Decycling numbers of random regular graphs , 2002, Random Struct. Algorithms.

[33]  Bernard Mans,et al.  Randomized greedy algorithms for finding small k‐dominating sets of regular graphs , 2005, Random Struct. Algorithms.

[34]  Madhu Sudan,et al.  Limits of local algorithms over sparse random graphs , 2013, ITCS.

[35]  Bálint Virág,et al.  Local algorithms for independent sets are half-optimal , 2014, ArXiv.

[36]  Gabor Lippner,et al.  Borel oracles. An analytical approach to constant-time algorithms , 2009, 0907.1805.

[37]  Nicholas C. Wormald,et al.  The asymptotic distribution of short cycles in random regular graphs , 1981, J. Comb. Theory, Ser. B.

[38]  George Havas,et al.  On the Complexity of the Extended Euclidean Algorithm (extended abstract) , 2003, CATS.

[39]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[40]  Carlos Hoppen,et al.  Properties of graphs with large girth , 2008 .

[41]  Jan Volec,et al.  Fractional colorings of cubic graphs with large girth , 2011, SIAM J. Discret. Math..

[42]  Jan Volec,et al.  Domination number of cubic graphs with large girth , 2012, J. Graph Theory.

[43]  N. Wormald.  Differential Equations for Random Processes and Random Graphs , 1995 .

[44]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[45]  William Duckworth,et al.  Packing vertices and edges in random regular graphs , 2008, Random Struct. Algorithms.

[46]  William Duckworth,et al.  Large 2-Independent Sets of Regular Graphs , 2003, Electron. Notes Theor. Comput. Sci..

[47]  Maria J. Serna,et al.  Computation of the Bisection Width for Random d-Regular Graphs , 2004, LATIN.

[48]  Endre Csóka,et al.  Invariant Gaussian processes and independent sets on regular graphs of large girth , 2013, Random Struct. Algorithms.

[49]  James B. Shearer,et al.  A note on the independence number of triangle-free graphs , 1983, Discret. Math..

[50]  Michele Zito,et al.  Greedy Algorithms for Minimisation Problems in Random Regular Graphs , 2001, ESA.