On the intersection of critical percolation clusters and other tree-like random graphs
Preprint
Abstract
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random walk ranges. We obtain sharp excess deviation bounds on the number of intersection points of two or more clusters, under minimal assumption on the two-point function. The proofs are based on new bounds on the n-point function, in case of critical percolation, and on the joint moments of local times of branching random walks.Keywords
All Related Versions
This publication has 45 references indexed in Scilit:
- Critical exponents for a percolation model on transient graphsInventiones Mathematicae, 2022
- Large Deviations for Intersections of Random WalksCommunications on Pure and Applied Mathematics, 2022
- Critical Two-Point Function for Long-Range Models with Power-Law Couplings: The Marginal Case for ${d\ge d_{\rm c}}$Communications in Mathematical Physics, 2019
- Progress in High-Dimensional Percolation and Random Graphs2017
- Loop Condensation Effects in the Behavior of Random Walks1994
- Mean-field critical behaviour for percolation in high dimensionsCommunications in Mathematical Physics, 1990
- Sharpness of the phase transition in percolation modelsCommunications in Mathematical Physics, 1987
- The incipient infinite cluster in two-dimensional percolationProbability Theory and Related Fields, 1986
- Tree graph inequalities and critical behavior in percolation modelsJournal of Statistical Physics, 1984
- Some intersection properties of random walk pathsActa Mathematica Hungarica, 1960