English
Related papers

Related papers: Phase Coexistence and Slow Mixing for the Hard-Cor…

200 papers

The six-vertex model in statistical physics is a weighted generalization of the ice model on $\mathbb{Z}^2$ (i.e., Eulerian orientations) and the zero-temperature three-state Potts model (i.e., proper three-colorings). The phase diagram of…

Data Structures and Algorithms · Computer Science 2020-12-23 Matthew Fahrbach , Dana Randall

We give a new method for analysing the mixing time of a Markov chain using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes…

Probability · Mathematics 2007-05-23 Magnus Bordewich , Martin Dyer , Marek Karpinski

Consider a low temperature stochastic Ising model in the phase coexistence regime with Markov semigroup $P_t$. A fundamental and still largely open problem is the understanding of the long time behavior of $\d_\h P_t$ when the initial…

Probability · Mathematics 2010-10-05 Pietro Caputo , Fabio Martinelli

We present a single-particle Lennard-Jones (L-J) model for CO2 and N2. Simplified L-J models for other small polyatomic molecules can be obtained following the methodology described herein. The phase-coexistence diagrams of single-component…

Computational Physics · Physics 2015-06-11 Jun Li , Victor M. Calo

We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\lambda^{|I|}$, for a positive real parameter $\lambda$. For large $\lambda$, computing the partition…

Probability · Mathematics 2011-08-15 Ricardo Restrepo , Jinwoo Shin , Prasad Tetali , Eric Vigoda , Linji Yang

For different phases to coexist in equilibrium at constant temperature $T$ and pressure $P$, the condition of equal chemical potential $\mu$ must be satisfied. This condition dictates that, for a single-component system, the maximum number…

Soft Condensed Matter · Physics 2016-11-23 Kenji Akahane , John Russo , Hajime Tanaka

The hardcore model is one of the most classic and widely studied examples of undirected graphical models. Given a graph $G$, the hardcore model describes a Gibbs distribution of $\lambda$-weighted independent sets of $G$. In the last two…

Data Structures and Algorithms · Computer Science 2026-01-08 Zongchen Chen , Tianhui Jiang

Gibbs' phase rule states that two-phase coexistence of a single-component system, characterized by an n-dimensional parameter-space, may occur in an n-1-dimensional region. For example, the two equilibrium phases of the Ising model coexist…

Statistical Mechanics · Physics 2009-11-10 M. A. Munoz , F. de los Santos , M. M. Telo da Gama

We calculate the restricted phase diagram for the Falicov-Kimball model on a two-dimensional square lattice. We consider the limit where the conduction electron density is equal to the localized electron density, which is the limit related…

Strongly Correlated Electrons · Physics 2009-11-10 R. Lemanski , J. K. Freericks , G. Banach

We investigate the phase diagram of disordered copolymers at the interface between two selective solvents, and in particular its weak-coupling behavior, encoded in the slope $m_c$ of the critical line at the origin. In mathematical terms,…

Probability · Mathematics 2008-11-25 T. Bodineau , G. Giacomin , H. Lacoin , F. Toninelli

For the hard-core lattice gas model defined on independent sets weighted by an activity $\lambda$, we study the critical activity $\lambda_c(\mathbb{Z}^2)$ for the uniqueness/non-uniqueness threshold on the 2-dimensional integer lattice…

Discrete Mathematics · Computer Science 2014-07-10 Juan C. Vera , Eric Vigoda , Linji Yang

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of $k$-colorings of a graph $G$ on $n$ vertices with maximum degree $\Delta$ is rapidly mixing for $k\ge\Delta+2$. In FOCS 1999, Vigoda…

Data Structures and Algorithms · Computer Science 2018-11-01 Sitan Chen , Michelle Delcourt , Ankur Moitra , Guillem Perarnau , Luke Postle

We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…

Probability · Mathematics 2009-09-29 Thomas P. Hayes , Alistair Sinclair

In the two-type Richardson model on a graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, each vertex is at a given time in state $0$, $1$ or $2$. A $0$ flips to a $1$ (resp.\ $2$) at rate $\lambda_1$ ($\lambda_2$) times the number of…

Probability · Mathematics 2015-09-24 Maria Deijfen , Olle Häggström

We study Gibbs partition models, also known as composition schemes. Our main results comprehensively describe their phase diagram, including a phase transition from the convergent case described in Stufler (2018, Random Structures \&…

Probability · Mathematics 2022-11-22 Benedikt Stufler

We study algebraic properties of partition functions, particularly the location of zeros, through the lens of rapidly mixing Markov chains. The classical Lee-Yang program initiated the study of phase transitions via locating complex zeros…

Data Structures and Algorithms · Computer Science 2025-01-03 Jingcheng Liu , Chunyang Wang , Yitong Yin , Yixiao Yu

We consider the system of particles on a finite interval with pair-wise nearest neighbours interaction and external force. This model was introduced by Malyshev to study the flow of charged particles on a rigorous mathematical level. It is…

Probability · Mathematics 2016-06-15 Tatyana Turova

We present a new notion of probabilistic duality for random variables involving mixture distributions. Using this notion, we show how to implement a highly-parallelizable Gibbs sampler for weakly coupled discrete pairwise graphical models…

Machine Learning · Computer Science 2016-11-23 Lars Mescheder , Sebastian Nowozin , Andreas Geiger

We consider the Glauber dynamics for model of polymer interacting with a substrate or wall. The state space is the set of one-dimensional nearest-neighbor paths on $\mathbb{Z}$ with nonnegative integer coordinates, starting at $0$ and…

Probability · Mathematics 2021-08-17 Shangjie Yang

We give a new rapid mixing result for a natural random walk on the independent sets of a graph $G$. We show that when $G$ has bounded treewidth, this random walk -- known as the Glauber dynamics for the hardcore model -- mixes rapidly for…

Data Structures and Algorithms · Computer Science 2023-10-03 David Eppstein , Daniel Frishberg