290 research outputs found

    Inference from Matrix Products: A Heuristic Spin Glass Algorithm

    Full text link
    We present an algorithm for finding ground states of two dimensional spin glass systems based on ideas from matrix product states in quantum information theory. The algorithm works directly at zero temperature and defines an approximate "boundary Hamiltonian" whose accuracy depends on a parameter kk. We test the algorithm against exact methods on random field and random bond Ising models, and we find that accurate results require a kk which scales roughly polynomially with the system size. The algorithm also performs well when tested on small systems with arbitrary interactions, where no fast, exact algorithms exist. The time required is significantly less than Monte Carlo schemes.Comment: 4 pages, 1 figure, minor typos fixe

    Ground states and thermal states of the random field Ising model

    Get PDF
    The random field Ising model is studied numerically at both zero and positive temperature. Ground states are mapped out in a region of random and external field strength. Thermal states and thermodynamic properties are obtained for all temperatures using the the Wang-Landau algorithm. The specific heat and susceptibility typically display sharp peaks in the critical region for large systems and strong disorder. These sharp peaks result from large domains flipping. For a given realization of disorder, ground states and thermal states near the critical line are found to be strongly correlated--a concrete manifestation of the zero temperature fixed point scenario.Comment: 5 pages, 5 figures; new material added in this versio

    Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm

    Full text link
    Motivated by the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses coarse-grained parallelism to avoid the problems of existing parallel approaches. We demonstrate good relative and absolute speedups of our algorithm on a set of large graph instances taken from real-world applications. On a modern 40-core machine, our parallel implementation outperforms existing sequential implementations by up to a factor of 12 and other parallel implementations by factors of up to 3

    Using Strategy Improvement to Stay Alive

    Full text link
    We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information that is important with respect to applications. The weights of the edges of an MPG can be thought of as a gained/consumed energy -- depending on the sign. For each vertex, our algorithm computes the minimum amount of initial energy that is sufficient for player Max to ensure that in a play starting from the vertex, the energy level never goes below zero. Our algorithm is not the first algorithm that computes the minimum sufficient initial energies, but according to our experimental study it is the fastest algorithm that computes them. The reason is that it utilizes the strategy improvement technique which is very efficient in practice

    Critical slowing down in polynomial time algorithms

    Full text link
    Combinatorial optimization algorithms which compute exact ground state configurations in disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using arguments based on the physical picture of the model, including vanishing stiffness on scales beyond the correlation length and the ground state degeneracy, the number of operations carried out by one such algorithm, the push-relabel algorithm for the random field Ising model, can be estimated. Some scaling can also be predicted for the 2D spin glass.Comment: 4 pp., 3 fig

    Simulation of the Zero Temperature Behavior of a 3-Dimensional Elastic Medium

    Full text link
    We have performed numerical simulation of a 3-dimensional elastic medium, with scalar displacements, subject to quenched disorder. We applied an efficient combinatorial optimization algorithm to generate exact ground states for an interface representation. Our results indicate that this Bragg glass is characterized by power law divergences in the structure factor S(k)∼Ak−3S(k)\sim A k^{-3}. We have found numerically consistent values of the coefficient AA for two lattice discretizations of the medium, supporting universality for AA in the isotropic systems considered here. We also examine the response of the ground state to the change in boundary conditions that corresponds to introducing a single dislocation loop encircling the system. Our results indicate that the domain walls formed by this change are highly convoluted, with a fractal dimension df=2.60(5)d_f=2.60(5). We also discuss the implications of the domain wall energetics for the stability of the Bragg glass phase. As in other disordered systems, perturbations of relative strength δ\delta introduce a new length scale L∗∼δ−1/ζL^* \sim \delta^{-1/\zeta} beyond which the perturbed ground state becomes uncorrelated with the reference (unperturbed) ground state. We have performed scaling analysis of the response of the ground state to the perturbations and obtain ζ=0.385(40)\zeta = 0.385(40). This value is consistent with the scaling relation ζ=df/2−θ\zeta=d_f/2- \theta, where θ\theta characterizes the scaling of the energy fluctuations of low energy excitations.Comment: 20 pages, 13 figure

    Specific-Heat Exponent of Random-Field Systems via Ground-State Calculations

    Full text link
    Exact ground states of three-dimensional random field Ising magnets (RFIM) with Gaussian distribution of the disorder are calculated using graph-theoretical algorithms. Systems for different strengths h of the random fields and sizes up to N=96^3 are considered. By numerically differentiating the bond-energy with respect to h a specific-heat like quantity is obtained, which does not appear to diverge at the critical point but rather exhibits a cusp. We also consider the effect of a small uniform magnetic field, which allows us to calculate the T=0 susceptibility. From a finite-size scaling analysis, we obtain the critical exponents \nu=1.32(7), \alpha=-0.63(7), \eta=0.50(3) and find that the critical strength of the random field is h_c=2.28(1). We discuss the significance of the result that \alpha appears to be strongly negative.Comment: 9 pages, 9 figures, 1 table, revtex revised version, slightly extende

    Ground state numerical study of the three-dimensional random field Ising model

    Full text link
    The random field Ising model in three dimensions with Gaussian random fields is studied at zero temperature for system sizes up to 60^3. For each realization of the normalized random fields, the strength of the random field, Delta and a uniform external, H is adjusted to find the finite-size critical point. The finite-size critical point is identified as the point in the H-Delta plane where three degenerate ground states have the largest discontinuities in the magnetization. The discontinuities in the magnetization and bond energy between these ground states are used to calculate the magnetization and specific heat critical exponents and both exponents are found to be near zero.Comment: 10 pages, 6 figures; new references and small changes to tex
    • …
    corecore