The peculiar phase structure of random graph bisection

Journal of Mathematical Physics

Volumn 49, Issue 12, 2008, Pages

  Percus, Allon G ^a,b   Istrate, Gabriel ^c   Goņalves, Bruno ^d   Sumi, Robert Z ^c,e   Boettcher, Stefan ^d  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Research Institute e Austria Timisoara   (Romania)

^d EMORY UNIVERSITY   (United States)

^e BABE BOLYAI UNIVERSITY   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58149250531     PISSN: 00222488     EISSN: None     Source Type: Journal    
DOI: 10.1063/1.3043666     Document Type: Article

References (33)

1. Alpert, C. J. and Kahng A. B., " Recent directions in netlist partitioning: a survey.," Dig. Tech. Pap.-Symp. VLSI Technol. 19, 1 (1995).
2. Benjamini, I., Kozma, G., and Wormald, N., " The mixing time of the giant component of a random graph.," e-print arXiv:math.PR/0610459.
3. Benjamini, I. and Mossel, E., " On the mixing time of a simple random walk on the supercritical percolation cluster.," Probab. Theory Relat. Fields 125, 408 (2003). 0178-8051
4. Biroli, G., Monasson, R., and Weigt, M., " A variational description of the ground state structure in random satisfiability problems.," Eur. Phys. J. B 1434-6028 10.1007/s100510051065 14, 551 (2000).
5. Boettcher, S., " Extremal Optimization of Graph Partitioning at the Percolation Threshold.," J. Phys. A 0305-4470 10.1088/0305-4470/32/28/302 32, 5201 (1999).
6. Boettcher, S. and Percus, A. G., " Nature's way of optimizing.," Artif. Intell. 0004-3702 10.1016/S0004-3702(00)00007-2 119, 275 (2000).
7. Boettcher, S. and Percus, A. G., " Extremal optimization at the phase transition of the 3-coloring problem.," Phys. Rev. E 1063-651X 10.1103/PhysRevE.69.066703 69, 066703 (2004).
8. Bollobas, B., Random Graphs (Cambridge University Press, Cambridge, 2001).
9. Boykov, Y., Veksler, O., and Zabih, R., " Fast approximate energy minimization via graph cuts.," IEEE Trans. Pattern Anal. Mach. Intell. 0162-8828 10.1109/34.969114 23, 1222 (2001).
10. Cheeger, J., " A lower bound for the smallest eigenvalue of the Laplacian.," in Problems in Analysis (Papers Dedicated to Salomon Bochner, 1969), edited by, R. C. Gunning, (Princeton University Press, Princeton, 1970), pp. 195-199.
11. Cheeseman, P., Kanefsky, B., and Taylor, W. F., " Where the really hard problems are.," Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI'91) (Morgan Kaufmann, San Mateo, CA, 1991), pp. 331-337.
12. Erds, P. and Ŕnyi, A., " On Random Graphs I.," Publ. Math. (Debrecen) 6, 290 (1959).
13. Fu, Y. and Anderson, P. W., " Application of statistical mechanics to NP-complete problems in combinatorial optimisation.," J. Phys. A 0305-4470 10.1088/0305-4470/19/9/033 19, 1605 (1986).
14. Garey, M. R. and Johnson, D. S., Computers and Intractability (Freeman, San Francisco, 1979).
15. Goel, A., Rai, S., and Krishnamachari, B., " Monotone properties of random geometric graphs have sharp thresholds.," Ann. Appl. Probab. 15, 2535 (2005). 1050-5164
16. Goldberg, M. K. and Lynch, J. F., " Lower and upper bounds for the bisection width of a random graph.," Congr. Numer. 49, 19 (1985). 1050-5164
17. Goņalves, B., Istrate, G., Percus, A. G., and Boettcher, S., " The core peeling algorithm for graph bisection: an experimental evaluation.," Los Alamos National Laboratory Technical Report No. LA-UR 06-6863, 2006.
18. Holme, P., Kim, B. J., Yoon, C. N., and Han, S. K., " Attack vulnerability of complex networks.," Phys. Rev. E 1063-651X 10.1103/PhysRevE.65.056109 65, 056109 (2002).
19. Istrate, G., Kasiviswanathan, S., and Percus, A. G., " The cluster structure of minimum bisections of sparse random graphs.," Los Alamos National Laboratory Technical Report No. LA-UR 06-6566, 2006.
20. Istrate, G., Kasiviswanathan, S., and Percus, A. G. (unpublished).
21. Janson, S., uczak, T., and Ruciński, A., Random Graphs (Wiley, New York, 2000).
22. Kanter, I. and Sompolinsky, H., " Mean-field theory of spin-glasses with finite coordination number.," Phys. Rev. Lett. 0031-9007 10.1103/PhysRevLett.58.164 58, 164 (1987).
23. Kolmogorov, V. and Zabih, R., " What energy functions can be minimized via graph cuts?," IEEE Trans. Pattern Anal. Mach. Intell. 0162-8828 10.1109/TPAMI.2004.1262177 26, 147 (2004).
24. Liao, W., " Graph bipartitioning problem.," Phys. Rev. Lett. 0031-9007 10.1103/PhysRevLett.59.1625 59, 1625 (1987).
25. Liao, W., " Replica-symmetric solution of the graph-bipartitioning problem.," Phys. Rev. A 1050-2947 10.1103/PhysRevA.37.587 37, 587 (1988).
26. uczak, M. J. and McDiarmid, C., " Bisecting sparse random graphs.," Random Struct. Algorithms 1042-9832 10.1002/1098-2418(200101)18: 131::AID-RSA33.0.CO;2-1 18, 31 (2001).
27. Ḿzard, M. and Parisi, G., " Mean-field theory of randomly frustrated systems with finite connectivity.," Europhys. Lett. 0295-5075 10.1209/0295-5075/3/10/002 3, 1067 (1987).
28. Ḿzard, M., Parisi, G.,and Zecchina, R., " Analytic and algorithmic solutions of random satisfiability problems.," Science 0036-8075 10.1126/science.1073287 297, 812 (2002).
29. Ḿzard, M. and Zecchina, R., " Random K-satisfiability problem: from an analytical solution to an efficient algorithm.," Phys. Rev. E 1063-651X 10.1103/PhysRevE.66.056126 66, 056126 (2002).
30. Mitchell, D. G., Selman, B., and Levesque, H. J., " Hard and easy distributions for SAT problems.," Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI Press, Menlo Park, CA, 1992), pp. 459-465.
31. Penrose, M. D., Random Geometric Graphs (Oxford University Press, Oxford, 2003).
32. Percus, A. G., Istrate, G., and Moore, C., Computational Complexity and Statistical Physics (Oxford University Press, Oxford, 2006).
33. Pittel, B., " On tree census and the giant component in sparse random graphs.," Random Struct. Algorithms 1042-9832 10.1002/rsa.3240010306 1, 311 (1990).