Related papers: Percolation in the Harmonic Crystal and Voter Mode…
The voter model with stirring is a variant of the classical voter model on $\mathbb{Z}^d$ with two possible opinions (0 and 1) that, in addition to copying neighbouring opinions at rate 1, allows voters to interchange their opinions at…
The voter model on $\mathbb{Z}^d$ is a particle system that serves as a rough model for changes of opinions among social agents or, alternatively, competition between biological species occupying space. When $d \geq 3$, the set of…
In the $R$-spread out, $d$-dimensional voter model, each site $x$ of $\mathbb{Z}^d$ has state (or 'opinion') 0 or 1 and, with rate 1, updates its opinion by copying that of some site $y$ chosen uniformly at random among all sites within…
We study the bidimensional voter model on a square lattice with numerical simulations. We demonstrate that the evolution takes place in two distinct dynamic regimes; a first approach towards critical site percolation and a further approach…
A method to treat a N-component percolation model as effective one component model is presented by introducing a scaled control variable $p_{+}$. In Monte Carlo simulations on $16^{3}$, $32^{3}$, $64^{3}$ and $128^{3}$ simple cubic lattices…
We study models of correlated percolation where there are constraints on the occupation of sites that mimic force-balance, i.e. for a site to be stable requires occupied neighboring sites in all four compass directions in two dimensions. We…
In two space dimensions, the percolation point of the pure-site clusters of the Ising model coincides with the critical point T_c of the thermal transition and the percolation exponents belong to a special universality class. By introducing…
Several results are presented for site percolation on quasi-transitive, planar graphs $G$ with one end, when properly embedded in either the Euclidean or hyperbolic plane. If $(G_1,G_2)$ is a matching pair derived from some quasi-transitive…
We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…
A percolation model is proposed to explain the structural phase transitions found in Li$_{1-x}$H$_x$IO$_3$ mixed crystals as a function of the concentration parameter $x$. The percolation thresholds are obtained from Monte Carlo simulations…
A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…
In the voter model, vertices of a graph (interpreted as voters) adopt one out of two opinions (0 and 1), and update their opinions at random times by copying the opinion of a neighbor chosen uniformly at random. This process is dual to a…
We simulate the bond and site percolation models on several three-dimensional lattices, including the diamond, body-centered cubic, and face-centered cubic lattices. As on the simple-cubic lattice [Phys. Rev. E, \textbf{87} 052107 (2013)],…
In the polluted bootstrap percolation model, the vertices of a graph are independently declared initially occupied with probability p or closed with probability q. At subsequent steps, a vertex becomes occupied if it is not closed and it…
Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product…
We obtain confidence intervals for the location of the percolation phase transition in H\"aggstr\"om's divide and color model on the square lattice $\mathbb{Z}^2$ and the hexagonal lattice $\mathbb{H}$. The resulting probabilistic bounds…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
Consider the voter model on a box of side length $L$ (in the triangular lattice) with boundary votes fixed forever as type 0 or type 1 on two different halves of the boundary. Motivated by analogous questions in percolation, we study…
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…
We analyze a deterministic cellular automaton $\sigma^{\cdot} = (\sigma^n : n \geq 0)$ corresponding to the zero-temperature case of Domany's stochastic Ising ferromagnet on the hexagonal lattice $\mathbb H$. The state space ${\cal…