The longest edge in discrete and continuous long-range percolation - Archive ouverte HAL
Article Dans Une Revue Extremes Année : 2024

The longest edge in discrete and continuous long-range percolation

Résumé

We consider the random connection model in which an edge between two Poisson points at distance r is present with probability g(r). We conduct an extreme value analysis on this model, namely by investigating the longest edge with at least one endpoint within some finite observation window, as the volume of this window tends to infinity. We show that the length of the latter, after normalizing by some appropriate centering and scaling sequences, asymptotically behaves like one of each of the three extreme value distributions, depending on choices of the probability g(r). We prove our results by giving a formal construction of the model by means of a marked Poisson point process and a Poisson coupling argument adapted to this construction. In addition, we study a discrete variant of the model. We obtain parameter regimes with varying behavior in our findings and an unexpected singularity.
Fichier non déposé

Dates et versions

hal-04817025 , version 1 (03-12-2024)

Identifiants

Citer

Arnaud Rousselle, Ercan Sönmez. The longest edge in discrete and continuous long-range percolation. Extremes, 2024, 27 (4), pp.673-703. ⟨10.1007/s10687-024-00488-y⟩. ⟨hal-04817025⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More