The Metropolis Algorithm for Graph Bisection

@article{Jerrum1998TheMA,
  title={The Metropolis Algorithm for Graph Bisection},
  author={Mark Jerrum and Gregory B. Sorkin},
  journal={Discrete Applied Mathematics},
  year={1998},
  volume={82},
  pages={155-175}
}
We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing can. with high probability and in polynomial time, find the optimal bisection of a random graph in <G ,,,,! when p I. = @(n.‘-‘) for A 62. (The random graph model ?q,z,,ispecifies a “planted” bisection of density Y, separating two n;‘2-vertex subsets of slightly higher density ~7.) We shoM that simulated “annealing” at an appropriate fixed temperature (i.c.. the Metropolis algorithm) finds the unique… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Topics m black-box combinatorial optimization, Ph.D Thesi

  • A. Juels
  • Unixcrsity of California ;II Berkeley
  • 1996

Convergence and tinitc-time bchn\ ior 01‘ slmulatcd annealing, Ad

  • Appl. Probab. IX
  • 1986

7.eller, t Teller. Equation of stav calculation\ by f&t computer machmes

  • J. Chcm. Phys
  • 1953

Equation of stav calculation \ by f & t computer machmes

  • C. Schevon, t Teller eller
  • J . Chcm . Phys .
  • 1953

Similar Papers

Loading similar papers…