Jerrum, Mark and Sorkin, Gregory B. (1993) Simulated annealing for graph bisection. In: 34th Annual Symposium on Foundations of Computer Science , 3-5 November 1993 , Palo Alto, CA, USA .
We resolve in the affirmative a question of R.B. Boppana and T. Bui: whether simulated annealing can with high probability and in polynomial time, find the optimal bisection of a random graph an Gnpr when p-r=(ΘnΔ-2) for Δ⩽2. (The random graph model Gnpr specifies a “planted” bisection of density r, separating two n/2-vertex subsets of slightly higher density p.) We show that simulated “annealing” at an appropriate fixed temperature (i.e., the Metropolis algorithm) finds the unique smallest bisection in O(n2+ε) steps with very high probability, provided Δ>11/6. (By using a slightly modified neighborhood structure, the number of steps can be reduced to O(n1+ε).) We leave open the question of whether annealing is effective for Δ in the range 3/2<⩽11/6, whose lower limit represents the threshold at which the planted bisection becomes lost amongst other random small bisections. It also remains open whether hillclimbing (i.e. annealing at temperature 0) solves the same problem.
|Item Type:||Conference or Workshop Item (Paper)|
|Additional Information:||© 1993 The Authors|
|Library of Congress subject classification:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Sets:||Research centres and groups > Management Science Group
Departments > Management
|Date Deposited:||16 May 2011 12:59|
Actions (login required)
|Record administration - authorised staff only|