Polynomial combinatorial optimization methods for analysing the ground states of disordered systems

Abstract

We discuss the application of polynomial combinatorial optimization algorithms to extract the universal zero-temperature properties of various disordered systems. Dijkstras algorithm is used for models of non-directed elastic lines on general regular graphs with isotropically correlated random potentials. The successive shortest path algorithm for minimum-costflow problems is applied for the study of ground state properties and the entanglement of many elastic lines in a disordered environment and the disorder-induced loop percolation transition in a vortex glass model. The preflow-push algorithm for minimum-cut–maximum-flow problems is used for the investigation of a roughening transition occurring in a model for elastic manifolds in a periodic potential in the presence of point disorder. PACS numbers: 74.60.Ge, 05.40.−a (Some figures in this article are in colour only in the electronic version)

8 Figures and Tables

Cite this paper

@inproceedings{Rieger2003PolynomialCO, title={Polynomial combinatorial optimization methods for analysing the ground states of disordered systems}, author={Heiko Rieger}, year={2003} }