Related papers: Leaf-excluded percolation in two and three dimensi…
In the confetti percolation model, or two-coloured dead leaves model, radius one disks arrive on the plane according to a space-time Poisson process. Each disk is coloured black with probability $p$ and white with probability $1-p$. In this…
We present the results of computer simulations on a class of percolative systems that forms a new universality class. We show the results for the critical exponents for this new class, inferred from simulations of two- and three-dimensional…
We study the transverse-field Ising model on a square lattice with bond- and site-dilution at zero temperature by stochastic series expansion quantum Monte Carlo simulations. Tuning the transverse field $h$ and the dilution $p$, the quantum…
We report results of high-precision Monte Carlo simulations of a three-dimensional lattice model in the O(3) universality class, in the presence of a surface. By a finite-size scaling analysis we have proven the existence of a special…
The enhanced binary tree (EBT) is a nontransitive graph which has two percolation thresholds $p_{c1}$ and $p_{c2}$ with $p_{c1}<p_{c2}$. Our Monte Carlo study implies that the second threshold $p_{c2}$ is significantly lower than a recent…
We investigate the lattice Coulomb glass model in three dimensions via Monte Carlo simulations. No evidence for an equilibrium glass phase is found down to very low temperatures, although the correlation length increases rapidly near T=0. A…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
Dependency links in single-layer networks offer a convenient way of modeling nonlocal percolation effects in networked systems where certain pairs of nodes are only able to function together. We study the percolation properties of the weak…
We consider a directed variant of the negative-weight percolation model in a two-dimensional, periodic, square lattice. The problem exhibits edge weights which are taken from a distribution that allows for both positive and negative values.…
Monte Carlo simulations are used to study lattice gases of particles with extended hard cores on a two dimensional square lattice. Exclusions of one and up to five nearest neighbors (NN) are considered. These can be mapped onto hard squares…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…
Spatial random graphs capture several important properties of real-world networks. We prove quenched results for the continuum space version of scale-free percolation introduced in [DW18]. This is an undirected inhomogeneous random graph…
Bootstrap percolation is a wide class of monotone cellular automata with random initial state. In this work we develop tools for studying in full generality one of the three `universality' classes of bootstrap percolation models in two…
We present an analysis of extensive large-scale Monte Carlo simulations of self-avoiding fixed-connectivity membranes for sizes (number of faces) ranging from 512 to 17672 (triangular) plaquettes. Self-avoidance is implemented via…
The edge-cubic spin model on square lattice is studied via Monte Carlo simulation with cluster algorithm. By cooling the system, we found two successive symmetry breakings, i.e., the breakdown of $O_h$ into the group of $C_{3h}$ which then…
For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution…
This paper exhibits a Monte Carlo study on site percolation using the Newmann-Ziff algorithm in distorted square and simple cubic lattices where each site is allowed to be directly linked with any other site if the euclidean separation…
We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering,…
We present a stochastic evolutionary model obtained through a perturbation of Kauffman's maximally rugged model, which is recovered as a special case. Our main results are: (i) existence of a percolation-like phase transition in the finite…