Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPercolation of finite clusters and shielded paths
52
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In independent bond percolation on $mathbb{Z}^d$ with parameter $p$, if one removes the vertices of the infinite cluster (and incident edges), for which values of $p$ does the remaining graph contain an infinite cluster? Grimmett-Holroyd-Kozma used the triangle condition to show that for $d geq 19$, the set of such $p$ contains values strictly larger than the percolation threshold $p_c$. With the work of Fitzner-van der Hofstad, this has been reduced to $d geq 11$. We improve this result by showing that for $d geq 10$ and some $p>p_c$, there are infinite paths consisting of shielded vertices --- vertices all whose adjacent edges are closed --- which must be in the complement of the infinite cluster. Using numerical values of $p_c$, this bound can be reduced to $d geq 7$. Our methods are elementary and do not require the triangle condition.
rate research
Read More
We prove that the heavy clusters are indistinguishable for Bernoulli percolation on quasi-transitive nonunimodular graphs. As an application, we show that the uniqueness threshold of any quasi-transitive graph is also the threshold for connectivity decay. This resolves a question of Lyons and Schramm (1999) in the Bernoulli percolation case and confirms a conjecture of Schonmann (2001). We also prove that every infinite cluster of Bernoulli percolation on a nonamenable quasi-transitive graph is transient almost surely.
We prove that the free energy of directed polymer in Bernoulli environment converges to the growth rate for the number of open paths in super-critical oriented percolation as the temperature tends to zero. Our proof is based on rate of convergence results which hold uniformly in the temperature. We also prove that the convergence rate is locally uniform in the percolation parameter inside the super-critical phase, which implies that the growth rate depends continuously on the percolation parameter.
I consider p-Bernoulli bond percolation on graphs of vertex-transitive tilings of the hyperbolic plane with finite sided faces (or, equivalently, on transitive, nonamenable, planar graphs with one end) and on their duals. It is known (Benjamini and Schramm) that in such a graph G we have three essential phases of percolation, i. e. 0 < p_c(G) < p_u(G) < 1, where p_c is the critical probability and p_u - the unification probability. I prove that in the middle phase a. s. all the ends of all the infinite clusters have one-point boundary in the boundary of H^2. This result is similar to some results of Lalley.
We consider self-avoiding walk, percolation and the Ising model with long and finite range. By means of the lace expansion we prove mean-field behavior for these models if $d>2(alphawedge2)$ for self-avoiding walk and the Ising model, and $d>3(alphawedge2)$ for percolation, where $d$ denotes the dimension and $alpha$ the power-law decay exponent of the coupling function. We provide a simplified analysis of the lace expansion based on the trigonometric approach in Borgs et al. (2007)
We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph in that an uninfected vertex becomes type 1 (2) infected at rate $lambda_1$ ($lambda_2$) times the number of nearest neighbors of type 1 (2). Assuming (essentially) that the degree of a randomly chosen vertex has finite second moment, we show that if $lambda_1=lambda_2$, then the fraction of vertices that are ultimately infected by type 1 converges to a continuous random variable $Vin(0,1)$, as the number of vertices tends to infinity. Both infection types hence occupy a positive (random) fraction of the vertices. If $lambda_1 eq lambda_2$, on the other hand, then the type with the larger intensity occupies all but a vanishing fraction of the vertices. Our results apply also to a uniformly chosen simple graph with the given degree sequence.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
