2,475 research outputs found

    Cluster update and recognition

    Full text link
    We present a fast and robust cluster update algorithm that is especially efficient in implementing the task of image segmentation using the method of superparamagnetic clustering. We apply it to a Potts model with spin interactions that are are defined by gray-scale differences within the image. Motivated by biological systems, we introduce the concept of neural inhibition to the Potts model realization of the segmentation problem. Including the inhibition term in the Hamiltonian results in enhanced contrast and thereby significantly improves segmentation quality. As a second benefit we can - after equilibration - directly identify the image segments as the clusters formed by the clustering algorithm. To construct a new spin configuration the algorithm performs the standard steps of (1) forming clusters and of (2) updating the spins in a cluster simultaneously. As opposed to standard algorithms, however, we share the interaction energy between the two steps. Thus the update probabilities are not independent of the interaction energies. As a consequence, we observe an acceleration of the relaxation by a factor of 10 compared to the Swendson and Wang procedure.Comment: 4 pages, 2 figure

    Current-Induced Step Bending Instability on Vicinal Surfaces

    Full text link
    We model an apparent instability seen in recent experiments on current induced step bunching on Si(111) surfaces using a generalized 2D BCF model, where adatoms have a diffusion bias parallel to the step edges and there is an attachment barrier at the step edge. We find a new linear instability with novel step patterns. Monte Carlo simulations on a solid-on-solid model are used to study the instability beyond the linear regime.Comment: 4 pages, 4 figure

    On generalized cluster algorithms for frustrated spin models

    Full text link
    Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for the fully frustrated Ising model on a square lattice, by placing bonds between sites based on information from plaquettes rather than links of the lattice. Here we study some properties of this algorithm and some variants of it. We introduce a practical methodology for constructing a generalized cluster algorithm for a given spin model, and investigate apply this method to some other frustrated Ising models. We find that such algorithms work well for simple fully frustrated Ising models in two dimensions, but appear to work poorly or not at all for more complex models such as spin glasses.Comment: 34 pages in RevTeX. No figures included. A compressed postscript file for the paper with figures can be obtained via anonymous ftp to minerva.npac.syr.edu in users/paulc/papers/SCCS-527.ps.Z. Syracuse University NPAC technical report SCCS-52

    Percolation and cluster Monte Carlo dynamics for spin models

    Get PDF
    A general scheme for devising efficient cluster dynamics proposed in a previous letter [Phys.Rev.Lett. 72, 1541 (1994)] is extensively discussed. In particular the strong connection among equilibrium properties of clusters and dynamic properties as the correlation time for magnetization is emphasized. The general scheme is applied to a number of frustrated spin model and the results discussed.Comment: 17 pages LaTeX + 16 figures; will appear in Phys. Rev.

    Graphical representations and cluster algorithms for critical points with fields

    Full text link
    A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical representation. Results from numerical simulations of the Ising model in a staggered field are presented. The dynamic exponent for the algorithm is measured to be less than 0.5.Comment: Revtex, 12 pages with 2 figure

    Transition matrix Monte Carlo method for quantum systems

    Full text link
    We propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole range of temperature. The method is based on several recent findings in Monte Carlo techniques, such as the loop algorithm and the transition matrix Monte Carlo method. In particular, we derive an exact relation between the DOS and the expectation value of the transition probability for quantum systems, which turns out to be useful in reducing the statistical errors in various estimates.Comment: 6 pages, 4 figure

    Breaking quantum linearity: constraints from human perception and cosmological implications

    Full text link
    Resolving the tension between quantum superpositions and the uniqueness of the classical world is a major open problem. One possibility, which is extensively explored both theoretically and experimentally, is that quantum linearity breaks above a given scale. Theoretically, this possibility is predicted by collapse models. They provide quantitative information on where violations of the superposition principle become manifest. Here we show that the lower bound on the collapse parameter lambda, coming from the analysis of the human visual process, is ~ 7 +/- 2 orders of magnitude stronger than the original bound, in agreement with more recent analysis. This implies that the collapse becomes effective with systems containing ~ 10^4 - 10^5 nucleons, and thus falls within the range of testability with present-day technology. We also compare the spectrum of the collapsing field with those of known cosmological fields, showing that a typical cosmological random field can yield an efficient wave function collapse.Comment: 13 pages, LaTeX, 3 figure

    An interacting spin flip model for one-dimensional proton conduction

    Full text link
    A discrete asymmetric exclusion process (ASEP) is developed to model proton conduction along one-dimensional water wires. Each lattice site represents a water molecule that can be in only one of three states; protonated, left-pointing, and right-pointing. Only a right(left)-pointing water can accept a proton from its left(right). Results of asymptotic mean field analysis and Monte-Carlo simulations for the three-species, open boundary exclusion model are presented and compared. The mean field results for the steady-state proton current suggest a number of regimes analogous to the low and maximal current phases found in the single species ASEP [B. Derrida, Physics Reports, {\bf 301}, 65-83, (1998)]. We find that the mean field results are accurate (compared with lattice Monte-Carlo simulations) only in the certain regimes. Refinements and extensions including more elaborate forces and pore defects are also discussed.Comment: 13pp, 6 fig
    corecore