REVIEW 1 cited by
On the intersection of critical percolation clusters and other tree-like random graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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
Forward citations
Cited by 1 Pith paper
-
Critical long-range percolation I: High effective dimension
In the regime d > min{6, 3alpha}, critical long-range percolation clusters have an n^{-1/2} volume tail and integrated superprocess scaling limits, switching from super-Levy (alpha < 2) to super-Brownian (alpha >= 2);...
Discussion (0). Continue with ORCID to comment.