相关论文: Sharp Metastability Threshold for Two-Dimensional …
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\}$,…
We study mixed long-range percolation on the square lattice. Each vertical edge of unit length is independently open with probability $\varepsilon$, and each horizontal edge of length $i$ is independently open with probability $p_i$. Also,…
We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…
The width W of the active region around an active moving wall in a directed percolation process diverges at the percolation threshold p_c as W \simeq A \epsilon^{-\nu_\parallel} \ln(\epsilon_0/\epsilon), with \epsilon=p_c-p, \epsilon_0 a…
We consider bootstrap percolation on the binomial random graph $G(n,p)$ with infection threshold $r\in \mathbb{N}$, an infection process which starts from a set of initially infected vertices and in each step every vertex with at least $r$…
In this paper, we investigate the invasion percolation (IP) in imperfect support in which the configuration of imperfections is considered to be correlated. Three lattice models were engaged to realize this pattern: site percolation, Ising…
We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1\}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots,k$, where $k\ge 2$. We find asymptotics of the critical probability of…
We study the threshold behaviour of two dimensional Schr{\" o}dinger operators with finitely many local point interactions. We show that the resolvent can either be continuously extended up to the threshold, in which case we say that the…
We study the distribution of the percolation time $T$ of two-neighbour bootstrap percolation on $[n]^2$ with initial set $A\sim\mathrm{Bin}([n]^2,p)$. We determine $T$ with high probability up to a constant factor for all $p$ above the…
We generalize the directed percolation (DP) model by relaxing the strict directionality of DP such that propagation can occur in either direction but with anisotropic probabilities. We denote the probabilities as $p_{\downarrow}= p \cdot…
In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $\theta_n(p)$ is the probability that there is a path…
Bootstrap percolation is a deterministic cellular automaton in which vertices of a graph~$G$ begin in one of two states, "dormant" or "active". Given a fixed integer $r$, a dormant vertex becomes active if at any stage it has at least $r$…
A random graph model on a host graph H is said to be 1-independent if for every pair of vertex-disjoint subsets A,B of E(H), the state of edges (absent or present) in A is independent of the state of edges in B. For an infinite connected…
We study the stationary distribution of the (spread-out) $d$-dimensional contact process from the point of view of site percolation. In this process, vertices of $\mathbb{Z}^d$ can be healthy (state 0) or infected (state 1). With rate one…
The probability of simultaneous occurence of at least k spanning clusters has been studied by Monte Carlo simulations on the 2D square lattice at the bond percolation threshold $p_c=1/2$. It is found that the probability of k and more…
We consider a percolation process in which $k$ points separated by a distance proportional to system size $L$ simultaneously connect together ($k>1$), or a single point at the center of a system connects to the boundary ($k=1$), through…
We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…
We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…
We consider bond percolation on the square lattice with perfectly correlated random probabilities. According to scaling considerations, mapping to a random walk problem and the results of Monte Carlo simulations the critical behavior of the…
This works investigates the Lyapunov-Oseledets spectrum of transfer operator cocycles associated to one-dimensional random paired tent maps depending on a parameter $\epsilon$, quantifying the strength of the \emph{leakage} between two…