Expansion and Lack Thereof in Randomly Perturbed Graphs

This paper studies the expansion properties of randomly perturbed graphs. These graphs are formed by adding, for example, a random 1-out or very sparse Erdős-Rényi graph to an arbitrary connected graph. The central results show that there exists a constant δ such that when any connected n-vertex base graph G 0 is perturbed by adding a random 1-out then, with high probability, the resulting graph has for all S ⊆ V with . When G 0 is perturbed by adding a random Erdős-Rényi graph, 𝔾 n,ε/n , the expansion of the perturbed graph depends on the structure of the base graph. A necessary condition for the base graph is given under which the resulting graph is an expander with high probability. The proof techniques are also applied to study rapid mixing in the small-worlds graphs described by Watts and Strogatz in [Watts and Strogatz 98] and by Kleinberg in [Kleinberg 00]. Analysis of Kleinberg's model shows that the graph stops being an expander exactly at the point where a decentralized algorithm is effective in constructing a short path. The proofs of expansion rely on a method of summing over subsets of vertices that allows an argument based on the first-moment method to succeed.

[1]  A. Sokal,et al.  Bounds on the ² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality , 1988 .

[2]  C. Wu.  Algebraic connectivity of directed graphs , 2005 .

[3]  F. Chung,et al.  Eigenvalues of Random Power law Graphs , 2003 .

[4]  Daniel A. Spielman,et al.  Improved smoothed analysis of the shadow vertex simplex method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[5]  Christos H. Papadimitriou,et al.  On the Eigenvalue Power Law , 2002, RANDOM.

[6]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

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

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

[9]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[10]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

[11]  Amin Saberi,et al.  On certain connectivity properties of the internet topology , 2006, J. Comput. Syst. Sci..

[12]  R. Monasson.  Diffusion, localization and dispersion relations on “small-world” lattices , 1999 .

[13]  Colin Cooper,et al.  Randomization and Approximation Techniques in Computer Science , 1999, Lecture Notes in Computer Science.

[14]  M. Biskup.  On the scaling of the chemical distance in long-range percolation models , 2003, math/0304418.

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

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

[17]  D. Gamarnik,et al.  The diameter of a long range percolation graph , 2002, SODA 2002.

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

[19]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

[20]  Luca Becchetti,et al.  Average case and smoothed competitive analysis of the multi-level feedback algorithm , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[22]  Guy E. Blelloch,et al.  Compact representations of separable graphs , 2003, SODA '03.

[23]  Fan Chung Graham,et al.  Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract) , 2004, WAW.

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

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

[26]  W. T. Gowers,et al.  RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .

[27]  Alan M. Frieze,et al.  Crawling on Simple Models of Web Graphs , 2004, Internet Math..

[28]  Alan M. Frieze,et al.  High Degree Vertices and Eigenvalues in the Preferential Attachment Graph , 2005, Internet Math..

[29]  B. Sudakov,et al.  On smoothed analysis in dense graphs and formulas , 2006 .

[30]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[31]  Craig Partridge,et al.  Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication , 2000, SIGCOMM 2000.

[32]  Ernesto Estrada,et al.  Spectral scaling and good expansion properties in complex networks , 2006, Europhysics Letters (EPL).

[33]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[34]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[35]  János Komlós,et al.  The eigenvalues of random symmetric matrices , 1981, Comb..

[36]  Alan M. Frieze,et al.  A Geometric Preferential Attachment Model of Networks , 2004, WAW.

[37]  F. Chung.  Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .

[38]  J. Cheeger.  A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[39]  F. Juhász.  On the spectrum of a random graph , 1981 .

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

[41]  U. Feige,et al.  Spectral techniques applied to sparse random graphs , 2005 .

[42]  Linyuan Lu,et al.  The Small World Phenomenon in Hybrid Power Law Graphs , 2004 .

[43]  Alan M. Frieze,et al.  The diameter of randomly perturbed digraphs and some applications , 2007, International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.

[44]  Endre Szemerédi,et al.  On the second eigenvalue of random regular graphs , 1989, STOC '89.

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

[46]  Noam Berger,et al.  The diameter of long-range percolation clusters on finite cycles , 2001, Random Struct. Algorithms.