English
Related papers

Related papers: Slab percolation for the Ising model revisited

200 papers

We prove a formula, first obtained by Kleban, Simmons and Ziff using conformal field theory methods, for the (renormalized) density of a critical percolation cluster in the upper half-plane "anchored" to a point on the real line. The proof…

Mathematical Physics · Physics 2023-12-19 Federico Camia

We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…

Disordered Systems and Neural Networks · Physics 2020-07-08 S. S. Manna , Robert M. Ziff

We study percolation on nonamenable groups at the uniqueness threshold $p_u$, the critical value that separates the phase in which there are infinitely many infinite clusters from the phase in which there is a unique infinite cluster. The…

Probability · Mathematics 2024-09-20 Tom Hutchcroft , Minghao Pan

In recent years, important progress has been made in the field of two-dimensional statistical physics. One of the most striking achievements is the proof of the Cardy-Smirnov formula. This theorem, together with the introduction of…

Probability · Mathematics 2013-06-10 Vincent Beffara , Hugo Duminil-Copin

We study Poisson--Voronoi percolation and its discrete analogue Bernoulli--Voronoi percolation in spaces with a non-amenable product structure. We develop a new method of proving smallness of the uniqueness threshold $p_u(\lambda)$ at small…

Probability · Mathematics 2025-12-01 Matteo D'Achille , Jan Grebík , Ali Khezeli , Konstantin Recke , Amanda Wilkens

We present a setup that enables to define in a concrete way a renormalization flow for the FK-percolation models from statistical physics (that are closely related to Ising and Potts models). In this setting that is applicable in any…

Probability · Mathematics 2017-07-31 Wendelin Werner

The Fortuin-Kasteleyn mapping between the Ising model and the site-bond correlated percolation model is shown to be only one of an infinite class of exact mappings. These new cluster representations are a result of "renormalized"…

High Energy Physics - Lattice · Physics 2009-10-22 R. Brower , P. Tamayo

The properties of the pure-site clusters of spin models, i.e. the clusters which are obtained by joining nearest-neighbour spins of the same sign, are here investigated. In the Ising model in two dimensions it is known that such clusters…

Statistical Mechanics · Physics 2009-11-07 Santo Fortunato

We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…

Statistical Mechanics · Physics 2017-05-16 Ralph Kenna , Bertrand Berche

We study Bernoulli percolation on $\mathbb Z^d$ in dimensions ${d>6}$. We prove that a classical consequence of the van den Berg-Kesten inequality, often referred to as the Simon-Lieb inequality in the context of the Ising model, admits a…

Probability · Mathematics 2026-05-29 Romain Panis , Bruno Schapira

The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds,…

Statistical Mechanics · Physics 2025-09-30 Tao Chen , Jinhong Zhu , Wei Zhong , Sheng Fang , Youjin Deng

We show that a superposition of an $\varepsilon$-Bernoulli bond percolation and any everywhere percolating subgraph of $\mathbb Z^d$, $d\ge 2$, results in a connected subgraph, which after a renormalization dominates supercritical Bernoulli…

Probability · Mathematics 2015-05-25 Itai Benjamini , Vincent Tassion

In this paper we establish some relations between percolation on a given graph G and its geometry. Our main result shows that, if G has polynomial growth and satisfies what we call the local isoperimetric inequality of dimension d > 1, then…

Probability · Mathematics 2014-09-23 Augusto Teixeira

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…

Probability · Mathematics 2021-12-17 Geoffrey Grimmett , Ioan Manolescu

Information percolation is a new method for analyzing stochastic spin systems through classifying and controlling the clusters of information-flow in the space-time slab. It yielded sharp mixing estimates (cutoff with an $O(1)$-window) for…

Probability · Mathematics 2015-01-05 Eyal Lubetzky , Allan Sly

In this note we provide an alternative proof of the fact that subcritical bootstrap percolation models have a positive critical probability in any dimension. The proof relies on a recent extension of the classical framework of Toom. This…

Probability · Mathematics 2023-01-03 Ivailo Hartarsky , Réka Szabó

In this paper we study percolation on a roughly transitive graph G with polynomial growth and isoperimetric dimension larger than one. For these graphs we are able to prove that p_c < 1, or in other words, that there exists a percolation…

Probability · Mathematics 2017-08-03 Elisabetta Candellero , Augusto Teixeira

The critical behaviour of many spin models can be equivalently formulated as percolation of specific site-bond clusters. In the presence of an external magnetic field, such clusters remain well-defined and lead to a percolation transition,…

High Energy Physics - Lattice · Physics 2009-11-07 Santo Fortunato , Helmut Satz

Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…

Statistical Mechanics · Physics 2008-01-13 Richard A. Neher , Klaus Mecke , Herbert Wagner

Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…

Probability · Mathematics 2025-06-03 Paul Drouvillé