A lower bound for point-to-point connection probabilities in critical percolation

DOI10.1214/20-ECP326zbMATH Open1456.60266arXiv1912.10964MaRDI QIDQ782843FDOQ782843

Authors: D. Kharzeev 

Publication date: 29 July 2020

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Abstract: Consider critical site percolation on $mathbb{Z}^d$ with $dgeq2$. We prove a lower bound of order $n^{-d^2}$ for point-to-point connection probabilities, where $n$ is the distance between the points. Most of the work in our proof concerns a `construction' which finally reduces the problem to a topological one. This is then solved by applying a topological fact, which follows from Brouwer's fixed point theorem. Our bound improves the lower bound with exponent $2d(d-1)$, used by Cerf in 2015 to obtain an upper bound for the so-called two-arm probabilities. Apart from being of interest in itself, our result gives a small improvement of the bound on the two-arm exponent found by Cerf.

Full work available at URL: https://arxiv.org/abs/1912.10964

Recommendations

• An upper bound on the two-arms exponent for critical percolation on \(\mathbb{Z}^d\)
• A lower bound on the two-arms exponent for critical percolation on the lattice
• A new lower bound for the critical probability of site percolation on the square lattice
• A SHORT PROOF OF THE HARRIS–KESTEN THEOREM
• Critical probability bounds for two-dimensional site percolation models

zbMATH Keywords

critical percolationconnection probabilities

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Cites Work

• Title not available (Why is that?)
• One-arm exponent for critical 2D percolation
• Percolation Processes: Lower Bounds for the Critical Probability
• Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
• A new proof of the sharpness of the phase transition for Bernoulli percolation on \(\mathbb{Z}^d\)
• Progress in high-dimensional percolation and random graphs
• Mean-field behavior for nearest-neighbor percolation in \(d>10\)
• A lower bound on the two-arms exponent for critical percolation on the lattice

Cited In (4)

• A correlation inequality for connection events in percolation
• Upper bounds on the one-arm exponent for dependent percolation models
• An upper bound on the two-arms exponent for critical percolation on \(\mathbb{Z}^d\)
• Some results on the asymptotic behavior of finite connection probabilities in percolation

This page was built for publication: A lower bound for point-to-point connection probabilities in critical percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782843)