The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln n) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL-complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ Dn,ǫ/n we obtain a “smoothed” instance. We show that, with high probability, a log-space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL 6⊆ almost-L then no heuristic can recognize similarly perturbed instances of (s, t)-connectivity. Property Testing: A digraph is called k-linked if, for every choice of 2k distinct vertices s1, . . . , sk, t1, . . . , tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1, . . . , k. Recognizing k-linked digraphs is NP-complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs which accepts k-linked graphs with high probability, and rejects all graphs which are at least ǫn arcs away from being k-linked.

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

[2]  Tom Bohman,et al.  How many random edges make a dense graph hamiltonian? , 2003, Random Struct. Algorithms.

[3]  Shang-Hua Teng,et al.  Smoothed Analysis (Motivation and Discrete Models) , 2003, WADS.

[4]  Alan M. Frieze,et al.  Adding random edges to dense graphs , 2004, Random Struct. Algorithms.

[5]  Kurt Mehlhorn,et al.  Smoothed Analysis of Three Combinatorial Problems , 2003, MFCS.

[6]  C. R. Subramanian,et al.  Algorithms for coloring semi-random graphs , 1998, Random Struct. Algorithms.

[7]  Joel H. Spencer,et al.  Coloring Random and Semi-Random k-Colorable Graphs , 1995, J. Algorithms.

[8]  Uriel Feige,et al.  A Tight Upper Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.

[9]  René Beier,et al.  Typical properties of winners and losers in discrete optimization , 2004, STOC '04.

[10]  Alan M. Frieze,et al.  The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence , 2004, Combinatorics, Probability and Computing.

[11]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[12]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[13]  Uriel Feige,et al.  Heuristics for Semirandom Graph Problems , 2001, J. Comput. Syst. Sci..

[14]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[15]  Fan Chung Graham,et al.  Diameter bounds for altered graphs , 1984, J. Graph Theory.

[16]  Robert Krauthgamer,et al.  Finding and certifying a large hidden clique in a semirandom graph , 2000, Random Struct. Algorithms.

[17]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[18]  Noam Nisan,et al.  On read-once vs. multiple access to randomness in logspace , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[19]  Heribert Vollmer,et al.  Measure One Results in Computational Complexity Theory , 1997, Advances in Algorithms, Languages, and Complexity.

[20]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[21]  Luca Becchetti,et al.  Smoothening Helps: A Probabilistic Analysis of the Multi-Level Feedback Algorithm , 2003 .

[22]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[23]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[24]  U. Feige,et al.  Finding and certifying a large hidden clique in a semirandom graph , 2000 .

[25]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[26]  Noga Alon,et al.  Decreasing the diameter of bounded degree graphs , 2000, J. Graph Theory.

[27]  D. Welsh,et al.  A Spectral Technique for Coloring Random 3-Colorable Graphs , 1994 .

[28]  Miklos Santha,et al.  Generating Quasi-random Sequences from Semi-random Sources , 1986, J. Comput. Syst. Sci..

[29]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[30]  Benny Sudakov,et al.  On smoothed analysis in dense graphs and formulas , 2006, Random Struct. Algorithms.

[31]  Béla Bollobás,et al.  The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..

[32]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .