Graph partitioning induced phase transitions.

We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree k. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any partitioning process (even if nonoptimal) that partitions the graph into essentially equal sized connected components (clusters), the system undergoes a percolation phase transition at f = fc = 1-2/k where f is the fraction of edges removed to partition the graph. For optimal partitioning, at the percolation threshold, we find S approximately N 0.4 where S is the size of the clusters and l approximately N 0.25 where l is their diameter. Also, we find that S undergoes multiple nonpercolation transitions for f

[1]  H. Stanley,et al.  Percolation theory applied to measures of fragmentation in social networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  H. Eugene Stanley,et al.  Building blocks of percolation clusters: volatile fractals , 1984 .

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

[4]  Tom C. Lubensky,et al.  Field Theory for the Statistics of Branched Polymers, Gelation, and Vulcanization , 1978 .

[5]  M. A. Muñoz,et al.  Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that , 2006, cond-mat/0605565.

[6]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[7]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[8]  Noga Alon,et al.  Combinatorics, Probability and Computing on the Edge-expansion of Graphs on the Edge-expansion of Graphs , 2022 .

[9]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[10]  Peter Buser,et al.  On the bipartition of graphs , 1984, Discret. Appl. Math..

[11]  B. Bollobás,et al.  Combinatorics, Probability and Computing , 2006 .

[12]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Stefan Boettcher,et al.  Extremal Optimization for Graph Partitioning , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[15]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[16]  F. T. Arecchi,et al.  Theory I , 1982 .

[17]  H. Stanley,et al.  Relation between dynamic transport properties and static topological structure for the lattice-animal model of branched polymers , 1984 .

[18]  G. Vojta.  Fractals and Disordered Systems , 1997 .

[19]  László Lovász,et al.  Graph theory and combinatorial biology , 1999 .

[20]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[21]  伏信 進矢,et al.  アイオワで computational な夏 , 2007 .

[22]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..