Graph Partitioning
- ISSN: 00319007
- PubMed: 17930449
Abstract
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<fc.
Graph Partitioning
Ulrich Elsner
Graph Partitioning
A survey
SFB 393
MASSIV
SI
M
U
LA
TI
O
N PARALLEL
M
Sonderforschungsbereich 393
Numerische Simulation
auf massiv parallelen Rechnern
Preprint SFB393/97-27, Dec. 1997
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
Groups
 |