Domain walls and Schramm-Loewner evolution in the random-field Ising
  model

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

The concept of Schramm-Loewner evolution provides a unified description of domain boundaries of many lattice spin systems in two dimensions, possibly even including systems with quenched disorder. Here, we study domain walls in the random-field Ising model. Although, in two dimensions, this system does not show an ordering transition to a ferromagnetic state, in the presence of a uniform external field spin domains percolate beyond a critical field strength. Using exact ground state calculations for very large systems, we examine ground state domain walls near this percolation transition finding strong evidence that they are conformally invariant and satisfy the domain Markov property, implying compatibility with Schramm-Loewner evolution (SLE\(_{\kappa}\)) with parameter \(\kappa = 6\). These results might pave the way for new field-theoretic treatments of systems with quenched disorder.

Related collections

Most cited references 10

Record: found
Abstract: found
Article: not found

An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision.

Yuri Boykov, Vladimir Kolmogorov (2004)

After [15], [31], [19], [8], [25], [5], minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision. The combinatorial optimization literature provides many min-cut/max-flow algorithms with different polynomial time complexity. Their practical efficiency, however, has to date been studied mainly outside the scope of computer vision. The goal of this paper is to provide an experimental comparison of the efficiency of min-cut/max flow algorithms for applications in vision. We compare the running times of several standard algorithms, as well as a new algorithm that we have recently developed. The algorithms we study include both Goldberg-Tarjan style "push-relabel" methods and algorithms based on Ford-Fulkerson style "augmenting paths." We benchmark these algorithms on a number of typical graphs in the contexts of image restoration, stereo, and segmentation. In many cases, our new algorithm works several times faster than any of the other methods, making near real-time performance possible. An implementation of our max-flow/min-cut algorithm is available upon request for research purposes.