2000 character limit reached
Optimal corrector estimates on percolation clusters
Published 2 May 2018 in math.PR and math.AP | (1805.00902v2)
Abstract: We prove optimal quantitative estimates on the first-order correctors on supercritical percolation clusters: we show that they are bounded in $d\geq 3$ and have logarithmic growth in $d = 2$, in the sense of stretched exponential moments. The main ingredients are a renormalization scheme of the supercritical percolation cluster, following the works of Pisztora and Barlow; large-scale regularity estimates developed in the previous paper; and a nonlinear concentration inequality of Efron-Stein type which is used to transfer quantitative information from the environment to the correctors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.