Related papers: Finite size scaling in three-dimensional bootstrap…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
The site and bond percolation problems are conventionally studied on (hyper)cubic lattices, which afford straightforward numerical treatments. The recent implementation of efficient simulation algorithms for high-dimensional systems now…
Bootstrap percolation provides an emblematic instance of phase behavior characterised by an abrupt transition with diverging critical fluctuations. This unusual hybrid situation generally occurs in particle systems in which the occupation…
Numerical simulations and finite-size scaling analysis have been carried out to study the percolation behavior of straight rigid rods of length $k$ ($k$-mers) on two-dimensional square lattices. The $k$-mers, containing $k$ identical units…
Consider the process where the $n$ vertices of a square $2$-dimensional torus appear consecutively in a random order. We show that typically the size of the $3$-core of the corresponding induced unit-distance graph transitions from $0$ to…
Percolation theory is usually applied to lattices with a uniform probability p that a site is occupied or that a bond is closed. The more general case, where p is a function of the position x, has received less attention. Previous studies…
We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…
The finite-size scaling functions for anisotropic three-dimensional Ising models of size $L_1 \times L_1 \times aL_1$ ($a$: anisotropy parameter) are studied by Monte Carlo simulations. We study the $a$ dependence of finite-size scaling…
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the $\pm e_i$-directions for each $i \in \{1,2,3\}$,…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
We examine bootstrap percolation in d-dimensional, directed metric graphs in the context of recent measurements of firing dynamics in 2D neuronal cultures. There are two regimes, depending on the graph size N. Large metric graphs are…
We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…
The BTW sandpile model is considered on three dimensional percolation lattice which is tunned with the occupation parameter $p$. Along with the three-dimensional avalanches, we study the energy propagation in two-dimensional cross-sections.…
In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…
A simple finite-size scaling theory is proposed here for anisotropic percolation models considering the cluster size distribution function as generalized homogeneous function of the system size and two connectivity lengths. The proposed…
We describe a 3D percolation-type approach to modeling of the processes of aging and certain other properties of tissues analyzed as systems consisting of interacting cells. Lattice sites are designated as regular (healthy) cells, senescent…
Accepting validity of self-consistent theory of localization by Vollhardt and Woelfle, we derive the finite-size scaling procedure used for studies of the critical behavior in d-dimensional case and based on the use of auxiliary quasi-1D…
In this paper we study in complete generality the family of two-state, deterministic, monotone, local, homogeneous cellular automata in $\mathbb{Z}^d$ with random initial configurations. Formally, we are given a set…
Bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realization of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at…
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number $r$, the $r$-neighbour bootstrap process is an update rule for vertices of a…