Related papers: Generating-function approach for bond percolations…
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in the network in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the…
High-density (HD) percolation describes the percolation over specific $\kappa$ -clusters, which are the compact sets of sites each connected to $\kappa$ nearest filled sites at least. It takes place in the classical patterns of…
Bond percolation on infinite heavy-tailed power-law random networks lacks a proper phase transition; or one may say, there is a phase transition at {\em zero percolation probability}. Nevertheless, a finite size percolation threshold…
In this article, we investigate explosive bond percolation (EBP) with product rule, formally known as Achlioptas process, on a scale-free multifractal weighted planar stochastic lattice (WPSL). One of the key features of the EBP transition…
Despite original claims of a first-order transition in the product rule model proposed by Achlioptas et al. [Science 323, 1453 (2009)], recent studies indicate that this percolation model, in fact, displays a continuous transition. The…
We study the cluster-size distribution of supercritical long-range percolation on $\mathbb{Z}^d$, where two vertices $x,y\in\mathbb{Z}^d$ are connected by an edge with probability $\mathrm{p}(\|x-y\|):=p\min(1,\beta\|x-y\|)^{-d\alpha}$ for…
We study critical bond percolation on a seven-dimensional (7D) hypercubic lattice with periodic boundary conditions and on the complete graph (CG) of finite volume $V$. We numerically confirm that for both cases, the critical number density…
Analytical results are derived for the bond percolation threshold and the size of the giant connected component in a class of random networks with non-zero clustering. The network's degree distribution and clustering spectrum may be…
We consider Bernoulli bond percolation on a large scale-free tree in the supercritical regime, meaning informally that there exists a giant cluster with high probability. We obtain a weak limit theorem for the sizes of the next largest…
We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…
We study the Gierer-Meinhardt model of reaction-diffusion on a site-disordered square lattice. Let $p$ be the site occupation probability of the square lattice. For $p$ greater than a critical value $p_c$, the steady state consists of…
A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours…
We study Bernoulli bond percolation on a random recursive tree of size $n$ with percolation parameter $p(n)$ converging to $1$ as $n$ tends to infinity. The sizes of the percolation clusters are naturally stored in a tree. We prove…
We simulate the bond and site percolation models on a simple-cubic lattice with linear sizes up to L=512, and estimate the percolation thresholds to be $p_c ({\rm bond})=0.248\,811\,82(10)$ and $p_c ({\rm site})=0.311\,607\,7(2)$. By…
We investigate the quantum percolation problem in a diluted chain with long-range hopping amplitudes. Each bond is activated with probability $p(r) = p_1/r^{\alpha}$, where $r$ is the distance between two sites and $\alpha$ characterizes…
Consider subcritical Bernoulli bond percolation with fixed parameter p<p_c. We define a dependent site percolation model by the following procedure: for each bond cluster, we colour all vertices in the cluster black with probability r and…
We consider the Bernoulli bond percolation process $\mathbb{P}_{p,p'}$ on the nearest-neighbor edges of $\mathbb{Z}^d$, which are open independently with probability $p<p_c$, except for those lying on the first coordinate axis, for which…
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…
In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…
We propose a maximally disassortative (MD) network model which realizes a maximally negative degree-degree correlation, and study its percolation transition to discuss the effect of a strong degree-degree correlation on the percolation…