相关论文: Percolation on a product of two trees

In this work we demonstrate the ability of the Minimal Spanning Tree to duplicate the information contained within a percolation analysis for a point dataset. We show how to construct the percolation properties from the Minimal Spanning…

H\"aggstr\"om, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph $G$. When $G$ is a tree they derived a necessary and sufficient condition for percolation to exist at some time $t$. In the case that $G$…

Consider percolation on $T\times \mathbb{Z}^d$, the product of a regular tree of degree $k\geq 3$ with the hypercubic lattice $\mathbb{Z}^d$. It is known that this graph has $0<p_c<p_u<1$, so that there are non-trivial regimes in which…

We consider the cardinality of supercritical oriented bond percolation in two dimensions. We show that, whenever the origin is conditioned to percolate, the process appropriately normalized converges asymptotically in distribution to the…

We study an interacting particle system in which moving particles activate dormant particles linked by the components of critical bond percolation. Addressing a conjecture from Beckman, Dinan, Durrett, Huo, and Junge for a continuous…

We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…

In this note we consider site percolation on a two dimensional sandwich of thickness two, the graph Z^2 x {0,1}. We prove that there is no percolation at the critical point. The same arguments are valid for a sandwich of thickness three…

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible…

We show that for percolation on any transitive graph, the triangle condition implies the open triangle condition.

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

It is natural to expect that there are only three possible types of scaling limits for the collection of all percolation interfaces in the plane: (1) a trivial one, consisting of no curves at all, (2) a critical one, in which all points of…

For horocyclic products of percolation subtrees of regular trees, we show almost sure amenability. Under a symmetry condition concerning the growth of the two percolation trees, we show the existence of an increasing Foelner sequence (which…

It was argued by Schramm and Smirnov that the critical site percolation exploration path on the triangular lattice converges in distribution to the trace of chordal SLE(6). We provide here a detailed proof, which relies on Smirnov's theorem…

An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…

We show that there exists a connected graph G with subexponential volume growth such that critical percolation on the product of G with the line has infinitely many infinite clusters. We also give some conditions under which this cannot…

We study versions of the contact process with three states, and with infections occurring at a rate depending on the overall infection density. Motivated by a model described in [17] for vegetation patterns in arid landscapes, we focus on…

We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…

In this paper we study bond percolation on a one-dimensional chain with power-law bond probability $C/ r^{1+\sigma}$, where $r$ is the distance length between distinct sites. We introduce and test an order $N$ Monte Carlo algorithm and we…

We postulate the existence of a natural Poissonian marking of the double (touching) points of SLE(6) and hence of the related continuum nonsimple loop process that describes macroscopic cluster boundaries in 2D critical percolation. We…

Consider the class of k-independent bond, respectively site, percolations with parameter p on an infinite tree T. We derive tight bounds on p for both a.s. percolation and a.s. nonpercolation. The bounds are continuous functions of k and…