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

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
Comment: comments are welcome