Universality in two‐dimensional enhancement percolation

We consider a type of dependent percolation introduced in 2 , where it is shown that certain “enhancements” of independent (Bernoulli) percolation, called essential, make the percolation critical probability strictly smaller. In this study we first prove that, for two‐dimensional enhancements with a natural monotonicity property, being essential is also a necessary condition to shift the critical point. We then show that (some) critical exponents and the scaling limit of crossing probabilities of a two‐dimensional percolation process are unchanged if the process is subjected to a monotonic enhancement that is not essential. This proves a form of universality for all dependent percolation models obtained via a monotonic enhancement (of Bernoulli percolation) that does not shift the critical point. For the case of site percolation on the triangular lattice, we also prove a stronger form of universality by showing that the full scaling limit 12 , 13 is not affected by any monotonic enhancement that does not shift the critical point. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Is the critical percolation probability local?

We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. We also prove a finite analogue of this statement, valid for expander graphs, without any girth assumption.     

Cut sets and normed cohomology with applications to percolation

We discuss an inequality for graphs, which relates the distances between components of any minimal cut set to the lengths of generators for the homology of the graph. Our motivation arises from percolation theory. In particular this result is applied to Cayley graphs of finite presentations of groups with one end, where it gives an exponential bound on the number of minimal cut sets, and thereby shows that the critical probability for percolation on these graphs is neither zero nor one. We further show for this same class of graphs that the critical probability for the coalescence of all infinite components into a single one is neither zero nor one.

     

A Harris‐Kesten theorem for confetti percolation

Percolation properties of the dead leaves model, also known as confetti percolation, are considered. More precisely, we prove that the critical probability for confetti percolation with square‐shaped leaves is 1/2. This result is related to a question of Benjamini and Schramm concerning disk‐shaped leaves and can be seen as a variant of the Harris‐Kesten theorem for bond percolation. The proof is based on techniques developed by Bollobás and Riordan to determine the critical probability for Voronoi and Johnson‐Mehl percolation. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 361–385, 2015     

Non-existence of phase transition of oriented percolation on Sierpinski carpet lattices

 A percolation problem on Sierpinski carpet lattices is considered. It is obtained that the critical probability of oriented percolation is equal to 1. In contrast it was already shown that the critical probability p _c of percolation is strictly less than 1 in Kumagai [9]. This result shows a difference between fractal-like lattice and ℤ ^d lattice. Received: 15 May 2002 / Revised version: 11 October 2002 / Published online: 21 February 2003 Mathematics Subject Classification (2000): Primary: 60K35, 82B43; Secondary: 82B26     

Fractal properties of percolation clusters in Euclidian neural networks

The process of spike packet propagation is observed in two-dimensional recurrent networks, consisting of locally coupled neuron pools. Local population dynamics is characterized by three key parameters – probability for pool connectedness, synaptic strength and neuron refractoriness. The formation of dynamic attractors in our model, synfire chains, exhibits critical behavior, corresponding to percolation phase transition, with probability for non-zero synaptic strength values representing the critical parameter. Applying the finite-size scaling method, we infer a family of critical lines for various synaptic strengths and refractoriness values, and determine the Hausdorff–Besicovitch fractal dimension of the percolation clusters.     

Bond percolation critical probability bounds for three Archimedean lattices

Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < p_c((3, 12²) bond) < .7449, .6430 < p_c((4, 6, 12) bond) < .7376, .6281 < p_c((4, 8²) bond) < .7201. Consequently, the bond percolation critical probability of the (3, 12²) lattice is strictly larger than those of the other ten Archimedean lattices. Thus, the (3, 12²) bond percolation critical probability is possibly the largest of any vertex‐transitive graph with bond percolation critical probability that is strictly less than one. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20: 507–518, 2002     

二维双重定向渗流及其临界概率函数

本文研究二维双重定向渗流模型，我们给出模型临界概率函数的一些基本性质，包括严格单调性、对称性和连续性，另外，我们指出，该临界概率函数的严格凹性是Grimmett相关猜想的充分条件。     

Sharp thresholds and percolation in the plane

Recently, it was shown by Bollobás and Riordan 4 that the critical probability for random Voronoi percolation in the plane is 1/2. As a by‐product of the method, a short proof of the Harris–Kesten Theorem was given by Bollobás and Riordan 5 . The aim of this paper is to show that the techniques used in these papers can be applied to many other planar percolation models, both to obtain short proofs of known results and to prove new ones. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

A lower bound for the critical probability of the square lattice site percolation

Summary We prove by elementary combinatorial considerations that the critical probability of the square lattice site percolation is larger than 0.503478.Work supported by the Central Research Found of the Hungarian Academy of Sciences (Grant No. 476/82)     

Critical phenomenon for a percolation model

We consider a percolation model which consists of oriented lines placed randomly on the plane. The lines are of random length and at a random angle with respect to the horizontal axis and are placed according to a Poisson point process; the length, angle, and orientation being independent of the underlying Poisson process. We establish a critical behaviour of this model, i.e., percolation occurs for large intensity of the Poisson process and does not occur for smaller intensities. In the special case when the lines are of fixed unit length and are either oriented vertically up or oriented horizontally to the left, with probability p or (1-p), respectively, we obtain a lower bound on the critical intensity of percolation.     

格点巢分形上的渗流模型

该文研究了一类格点分形图 (格点巢分形 )上的渗流模型 ,证明了该模型没有临界现象 ,进一步给出一个指数衰减律 .同时 ,指出一般有限分岔图上的渗流模型没有临界现象     

Coexistence of the infinite (*) clusters: — A remark on the square lattice site percolation

Summary We show that the critical probability p _c is strictly greater than 1/2 for the square lattice site percolation.     

Asymptotic of the Critical Value of the Large-Dimensional SIR Epidemic on Clusters

In this paper we are concerned with the susceptible-infective-removed (SIR) epidemic on open clusters of bond percolation on the square lattice. For the SIR model, a susceptible vertex is infected at rate proportional to the number of infective neighbors, while an infective vertex becomes removed at a constant rate. A removed vertex will never be infected again. We assume that at \(t=0\) the only infective vertex is the origin and define the critical value of the model as the supremum of the infection rates with which infective vertices die out with probability one; then, we show that the critical value under the annealed measure is \(\big (1+o(1)\big )/(2dp)\) as the dimension d of the lattice grows to infinity, where p is the probability that a given edge is open. Furthermore, we show that the critical value under the quenched measure equals the annealed one when the origin belongs to an infinite open cluster of the percolation.     

A new lower bound for the critical probability of site percolation on the square lattice

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Tóth [13]), 0.522 (Zuev [15]), and the best lower bound so far, 0.541 (Menshikov and Pelikh [12]). By a modification of the method of Menshikov and Pelikh we get a significant improvement, namely, 0.556. Apart from a few classical results on percolation and coupling, which are explicitly stated in the Introduction, this paper is self-contained. © 1996 John Wiley & Sons, Inc.     

The critical probability for Voronoi percolation in the hyperbolic plane tends to 1/2

We consider percolation on the Voronoi tessellation generated by a homogeneous Poisson point process on the hyperbolic plane. We show that the critical probability for the existence of an infinite cluster tends to 1/2 as the intensity of the Poisson process tends to infinity. This confirms a conjecture of Benjamini and Schramm [5].     

Long range percolation in stationary point processes

We consider a continuum percolation model in ?d, d ? 1 in which any two points of a stationary point process are connected with a probability which decays exponentially in the distance between the points. We give sufficient conditions for the (non)-existence of a phase transition. We also give examples of processes which show that it is impossible to write down a theorem which relates the critical parameter value of a process to its density. Finally, we show that uniqueness of the infinite cluster is still valid in this general setting. © 1993 John Wiley & Sons, Inc.     

Extending the excluded volume for percolation threshold estimates in polydisperse systems: The binary disk system

For dispersions containing a single type of particle, it has been observed that the onset of percolation coincides with a critical value of volume fraction. When the volume fraction is calculated based on excluded volume, this critical percolation threshold is nearly invariant to particle shape. The critical threshold has been calculated to high precision for simple geometries using Monte Carlo simulations, but this method is slow at best, and infeasible for complex geometries. This paper explores an analytical approach to the prediction of percolation threshold in polydisperse mixtures. Specifically, this paper suggests an extension of the concept of excluded volume, and applies that extension to the 2D binary disk system. The simple analytical expression obtained is compared to Monte Carlo results from the literature. The result may be computed extremely rapidly and matches key parameters closely enough to be useful for composite material design.     

Enlargement of subgraphs of infinite graphs by Bernoulli percolation

We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs, and a property of the subgraphs. Then, in a manner similar to the way Hammersley’s critical probability is defined, we can define two values associated with the triplet. We regard the two values as certain critical probabilities, and compare them with Hammersley’s critical probability. In this paper, we focus on the following cases of a graph property: being a transient subgraph, having finitely many cut points or no cut points, being a recurrent subset, or being connected. Our results depend heavily on the choice of the triplet.Most results of this paper are announced in Okamura (2016) [24] without proofs. This paper gives full details of them.     

Site percolation and isoperimetric inequalities for plane graphs

We use isoperimetric inequalities combined with a new technique to prove upper bounds for the site percolation threshold of plane graphs with given minimum degree conditions. In the process we prove tight new isoperimetric bounds for certain classes of hyperbolic graphs. This establishes the vertex isoperimetric constant for all triangular and square hyperbolic lattices, answering a question of Lyons and Peres. We prove that plane graphs of minimum degree at least 7 have site percolation threshold bounded away from 1/2, which was conjectured by Benjamini and Schramm, and make progress on a conjecture of Angel, Benjamini, and Horesh that the critical probability is at most 1/2 for plane triangulations of minimum degree 6. We prove additional bounds for stronger minimum degree conditions, and for graphs without triangular faces.