Vertex Models and Random Labyrinths: Phase Diagrams for Ice-type Vertex Models

We propose a simple geometric recipe for constructing phase diagrams for a general class of vertex models obeying the ice rule. The disordered phase maps onto the intersecting loop model which is interesting in its own right and is related to several other statistical mechanical models. This mapping is also useful in understanding some ordered phases of these vertex models as they correspond to the polymer loop models with cross-links in their vulcanised phase.Comment: 8 pages, 6 figure

Cluster Monte Carlo study of multi-component fluids of the Stillinger-Helfand and Widom-Rowlinson type

Phase transitions of fluid mixtures of the type introduced by Stillinger and Helfand are studied using a continuum version of the invaded cluster algorithm. Particles of the same species do not interact, but particles of different types interact with each other via a repulsive potential. Examples of interactions include the Gaussian molecule potential and a repulsive step potential. Accurate values of the critical density, fugacity and magnetic exponent are found in two and three dimensions for the two-species model. The effect of varying the number of species and of introducing quenched impurities is also investigated. In all the cases studied, mixtures of $q$-species are found to have properties similar to $q$-state Potts models.Comment: 25 pages, 5 figure

Quantal Density Functional Theory of Degenerate States

The treatment of degenerate states within Kohn-Sham density functional theory (KS-DFT) is a problem of longstanding interest. We propose a solution to this mapping from the interacting degenerate system to that of the noninteracting fermion model whereby the equivalent density and energy are obtained via the unifying physical framework of quantal density functional theory (Q-DFT). We describe the Q-DFT of \textit{both} ground and excited degenerate states, and for the cases of \textit{both} pure state and ensemble v-representable densities. This then further provides a rigorous physical interpretation of the density and bidensity energy functionals, and of their functional derivatives, of the corresponding KS-DFT. We conclude with examples of the mappings within Q-DFT.Comment: 10 pages. minor changes made. to appear in PR

Monte Carlo study of the Widom-Rowlinson fluid using cluster methods

The Widom-Rowlinson model of a fluid mixture is studied using a new cluster algorithm that is a generalization of the invaded cluster algorithm previously applied to Potts models. Our estimate of the critical exponents for the two-component fluid are consistent with the Ising universality class in two and three dimensions. We also present results for the three-component fluid.Comment: 13 pages RevTex and 2 Postscript figure

Thinning of superfluid films below the critical point

Experiments on $^4$He films reveal an attractive Casimir-like force at the bulk $\lambda$-point, and in the superfluid regime. Previous work has explained the magnitude of this force at the $\lambda$ transition and deep in the superfluid region but not the substantial attractive force immediately below the $\lambda$-point. Utilizing a simple mean-field calculation renormalized by critical fluctuations we obtain an effective Casimir force that is qualitatively consistent with the scaling function $\vartheta$ obtained by collapse of experimental data.Comment: 4 page

The Computational Complexity of Generating Random Fractals

In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation. Diffusion limited aggregation and several widely used algorithms for equilibrating the Ising model are shown to be highly sequential; it is unlikely they can be simulated efficiently in parallel. This is in contrast to Mandelbrot percolation that can be simulated in constant parallel time. Our research helps shed light on the intrinsic complexity of these models relative to each other and to different growth processes that have been recently studied using complexity theory. In addition, the results may serve as a guide to simulation physics.Comment: 28 pages, LATEX, 8 Postscript figures available from [email protected]

Rejoinder to the Response arXiv:0812.2330 to 'Comment on a recent conjectured solution of the three-dimensional Ising model'

We comment on Z. D. Zhang's Response [arXiv:0812.2330] to our recent Comment [arXiv:0811.3876] addressing the conjectured solution of the three-dimensional Ising model reported in [arXiv:0705.1045].Comment: 2 page

Avoided Critical Behavior in O(n) Systems

Long-range frustrating interactions, even if their strength is infinitesimal, can give rise to a dramatic proliferations of ground or near-ground states. As a consequence, the ordering temperature can exhibit a discontinuous drop as a function of the frustration. A simple model of the doped Mott insulator, where the short-range tendency of the holes to phase separate competes with long-range Coulomb effects, exhibits this "avoided critical" behavior. This model may serve as a paradigm for many other systems.Comment: 4 pages, 2 figure

Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions

We consider the general problem of finding the minimum weight \bm-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm converges to the correct solution. We also show that when the LP relaxation has a fractional solution then the BP algorithm can be used to solve the LP relaxation. Our proof is based on the notion of graph covers and extends the analysis of (Bayati-Shah-Sharma 2005 and Huang-Jebara 2007}. These results are notable in the following regards: (1) It is one of a very small number of proofs showing correctness of BP without any constraint on the graph structure. (2) Variants of the proof work for both synchronous and asynchronous BP; it is the first proof of convergence and correctness of an asynchronous BP algorithm for a combinatorial optimization problem.Comment: 28 pages, 2 figures. Submitted to SIAM journal on Discrete Mathematics on March 19, 2009; accepted for publication (in revised form) August 30, 2010; published electronically July 1, 201