Related papers: Critical exponents for two-dimensional percolation
Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…
The critical exponents and the critical amplitude ratio of the scalar model are determined using finite-temperature field theory with auxiliary mass. A new numerical method is developed to solve an evolution equation. The results are…
Recently, Holmes and Perkins identified conditions which ensure that for a class of critical lattice models the scaling limit of the range is the range of super-Brownian motion. One of their conditions is an estimate on a spatial moment of…
The critical behaviour of d-dimensional n-vector models at m-axial Lifshitz points is considered for general values of m in the large-n limit. It is proven that the recently obtained large-N expansions [J. Phys.: Condens. Matter 17, S1947…
We show that for critical site percolation on the triangular lattice two new observables have conformally invariant scaling limits. In particular the expected number of clusters separating two pairs of points converges to an explicit…
We review some of the results that have been derived in the last years on conformal invariance, scaling limits and properties of some two-dimensional random curves. In particular, we describe the intuitive ideas that lead to the definition…
In this note, we revisit the scaling relations among ``hatted critical exponents'' which were first derived by Ralph Kenna, Des Johnston and Wolfhard Janke, and we propose an alternative derivation for some of them. For the scaling relation…
After a brief review of the historical role of analyticity in the study of critical phenomena, an account is given of recent discoveries of discretely holomorphic observables in critical two-dimensional lattice models. These are objects…
The large-n expansion is applied to the calculation of thermal critical exponents describing the critical behavior of spatially anisotropic d-dimensional systems at m-axial Lifshitz points. We derive the leading nontrivial 1/n correction…
We consider the standard site percolation model on the $d$-dimensional lattice. A direct consequence of the proof of the uniqueness of the infinite cluster of Aizenman, Kesten and Newman [Comm. Math. Phys. 111 (1987) 505-531] is that the…
Hysteresis is observed at second order phase transitions. Universal scaling formul\ae{} for the areas of hysteresis loops are written down. Critical exponents are defined, and related to other exponents for static and dynamic critical…
We give mathematical proofs to a number of statements which appeared in the series of papers by Kleban, Simmons and Ziff where they computed the probabilities of several percolation crossing events.
Percolation is a cornerstone concept in physics, providing crucial insights into critical phenomena and phase transitions. In this study, we adopt a kinetic perspective to reveal the scaling behaviors of higher-order gaps in the largest…
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…
In this paper we present the proof of the convergence of the critical bond percolation exploration process on the square lattice to the trace of SLE$_{6}$. This is an important conjecture in mathematical physics and probability. The case of…
By Monte Carlo simulation we study the critical exponents governing the transition of the three-dimensional classical O(4) Heisenberg model, which is considered to be in the same universality class as the finite-temperature QCD with…
The localization transition and the critical properties of the Lorentz model in three dimensions are investigated by computer simulations. We give a coherent and quantitative explanation of the dynamics in terms of continuum percolation…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
In long-range percolation on $\mathbb{Z}^d$, points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $\alpha>0$ is fixed and $\beta \geq 0$ is a parameter. As $d$ and $\alpha$ vary, the model…
We derive an exact, simple relation between the average number of clusters and the wrapping probabilities for two-dimensional percolation. The relation holds for periodic lattices of any size. It generalizes a classical result of Sykes and…