On the intersection of critical percolation clusters and other tree-like random graphs

TL;DR

This paper investigates the intersection properties of multiple independent tree-like random graphs, including critical percolation clusters and branching random walk ranges, providing sharp bounds under minimal assumptions.

Contribution

It introduces new bounds on intersection points and joint moments of local times, advancing understanding of critical percolation and related structures.

Findings

Sharp excess deviation bounds for intersection points

New bounds on n-point functions in critical percolation

Analysis of joint moments of local times in branching random walks

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 proof 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