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

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Asselah, Amine, Schapira, Bruno
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916498396676096
author Asselah, Amine
Schapira, Bruno
author_facet Asselah, Amine
Schapira, Bruno
contents 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
format Preprint
id arxiv_https___arxiv_org_abs_2411_19145
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On the intersection of critical percolation clusters and other tree-like random graphs
Asselah, Amine
Schapira, Bruno
Probability
60J80, 60K35
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
title On the intersection of critical percolation clusters and other tree-like random graphs
topic Probability
60J80, 60K35
url https://arxiv.org/abs/2411.19145