Percolation of repulsive particles on graphs - Archive ouverte HAL
Chapitre D'ouvrage Année : 2021

Percolation of repulsive particles on graphs

Résumé

What are the percolation properties of a repulsive point process on an infinite connected graph? To treat this question, one starts by clearly state which definition of repulsivity is adopted here. The first issue is then to identify some repulsive point processes. The most known examples of repulsive point process are determinantal point processes. Are they some others? We construct some examples and give a general answer on their percolation properties. In case of determinantal point processes, we establish stochastic domination relations to obtain other sufficient conditions for percolation.
Fichier principal
Vignette du fichier
PercoRepulsive4.pdf (249.43 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03401540 , version 1 (25-10-2021)

Identifiants

Citer

Nathalie Eisenbaum. Percolation of repulsive particles on graphs. Catherine Donati-Martin, Antoine Lejay, Alain Rouault. Séminaire de Probabilités LI, 2301, Springer International Publishing, pp.381-396, 2021, Lecture Notes in Mathematics, ⟨10.1007/978-3-030-96409-2_12⟩. ⟨hal-03401540⟩
32 Consultations
30 Téléchargements

Altmetric

Partager

More