English
Related papers

Related papers: Frozen percolation in two dimensions

200 papers

Suitable cluster definitions have allowed researchers to describe many ordering transitions in spin systems as geometric phenomena related to percolation. For spin glasses and some other systems with quenched disorder, however, such a…

Disordered Systems and Neural Networks · Physics 2023-05-04 Lambert Münster , Martin Weigel

We study Mandelbrot's percolation process in dimension $d \geq 2$. The process generates random fractal sets by an iterative procedure which starts by dividing the unit cube $[0,1]^d$ in $N^d$ subcubes, and independently retaining or…

Probability · Mathematics 2008-02-22 Erik I. Broman , Federico Camia

In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…

Suspensions of hard core spherical particles of diameter $D$ with inter-core connectivity range $\delta$ can be described in terms of random geometric graphs, where nodes represent the sphere centers and edges are assigned to any two…

Disordered Systems and Neural Networks · Physics 2017-09-12 Claudio Grimaldi

Random sequential adsorption with diffusional relaxation, of two by two square objects on the two-dimensional square lattice is studied by Monte Carlo computer simulation. Asymptotically for large lattice sizes, diffusional relaxation…

Condensed Matter · Physics 2010-10-12 Jian-Sheng Wang , Peter Nielaba , Vladimir Privman

We consider the constrained-degree percolation (CDP) model on the hypercubic lattice. This is a continuous-time percolation model defined by a sequence $(U_e)_{e\in\mathcal{E}^d}$ of i.i.d. uniform random variables and a positive integer…

Using off-lattice noise reduction it is possible to estimate the asymptotic properties of diffusion-limited aggregation clusters grown in three dimensions with greater accuracy than would otherwise be possible. The fractal dimension of…

Statistical Mechanics · Physics 2009-11-10 Neill E. Bowler , Robin C. Ball

We analyze the crystallization and collapse transition of a simple model for flexible polymer chains on simple cubic and face-centered cubic lattices by means of sophisticated chain-growth methods. In contrast to bond-fluctuation polymer…

Soft Condensed Matter · Physics 2009-11-13 Thomas Vogel , Michael Bachmann , Wolfhard Janke

The freezing transition in a classical three-dimensional system of parallel hard cubes with rounded edges is studied by computer simulation and fundamental-measure density functional theory. By switching the rounding parameter s from zero…

Soft Condensed Matter · Physics 2014-11-20 Matthieu Marechal , Urs Zimmermann , Hartmut Löwen

Two related issues are explored for bond percolation on the d-dimensional cubic lattice (with d > 2) and its dual plaquette process. Firstly, for what values of the parameter p does the complement of the infinite open cluster possess an…

Probability · Mathematics 2019-02-20 Geoffrey R. Grimmett , Alexander E. Holroyd , Gady Kozma

We show analytically that the $[0,1]$, $[1,1]$ and $[2,1]$ Pad{\'e} approximants of the mean cluster number $S(p)$ for site and bond percolation on general $d$-dimensional lattices are upper bounds on this quantity in any Euclidean…

Statistical Mechanics · Physics 2015-06-12 Salvatore Torquato , Yang Jiao

We use molecular dynamics simulations to study a model of the gelation transition with a dynamic bond forming procedure. After establishing evidence for 3D percolation as the static universality class, we turn our attention to the dynamics…

Statistical Mechanics · Physics 2007-05-23 Sune Norhoj Jespersen

A split tree of cardinality $n$ is constructed by distributing $n$ "balls" in a subset of vertices of an infinite tree which encompasses many types of random trees such as $m$-ary search trees, quad trees, median-of-$(2k+1)$ trees,…

Probability · Mathematics 2021-05-27 Gabriel Berzunza , Xing Shi Cai , Cecilia Holmgren

How does the percolation transition behave in the absence of quenched randomness? To address this question, we study two nonrandom self-dual quasiperiodic models of square-lattice bond percolation. In both models, the critical point has…

Statistical Mechanics · Physics 2023-03-08 Grace M. Sommers , Michael J. Gullans , David A. Huse

We investigate the geometric properties of percolation clusters, by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo…

Statistical Mechanics · Physics 2015-06-17 Xiao Xu , Junfeng Wang , Zongzheng Zhou , Timothy M. Garoni , Youjin Deng

We prove absence of infinite clusters and contours in a class of critical constrained percolation models on the square lattice. The percolation configuration is assumed to satisfy certain hard local constraints, but only weak symmetry and…

Probability · Mathematics 2016-12-13 Alexander Holroyd , Zhongyang Li

Based on extensive parallel-tempering Monte Carlo simulations, we investigate the relationship between cluster percolation and equilibrium ordering phenomena in the three-dimensional $\pm J$ random-bond Ising model as one varies the…

Disordered Systems and Neural Networks · Physics 2026-03-05 Lambert Münster , Martin Weigel

We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+\lambda\delta^{1/\nu}$, with $\nu=4/3$, as the lattice spacing $\delta \to 0$. Our proposed framework extends previous analyses for $p=p_c$, based…

Statistical Mechanics · Physics 2015-06-25 F. Camia , L. R. G. Fontes , C. M. Newman

Two-dimensional structures grown with Witten and Sander algorithm are investigated. We analyze clusters grown off-lattice and clusters grown with antenna method with $N_{fp}=3,4,5,6,7$ and 8 allowed growth directions. With the help of…

Statistical Mechanics · Physics 2015-05-19 Anton Yu. Menshutin , Lev. N. Shchur

For critical bond-percolation on high-dimensional torus, this paper proves sharp lower bounds on the size of the largest cluster, removing a logarithmic correction in the lower bound in Heydenreich and van der Hofstad (2007). This…

Probability · Mathematics 2019-07-16 Markus Heydenreich , Remco van der Hofstad