Papers
Topics
Authors
Recent
Search
2000 character limit reached

Peaks over Threshold in Scale-Free Random Graphs

Published 16 Feb 2026 in math.PR | (2602.14817v1)

Abstract: We explore extreme value phenomena in spatial scale-free random graphs in a continuum setting based on a homogeneous Poisson point process in $\mathbb{R}d$. Vertices carry i.i.d. weights $(W_x)$ and, conditionally on the vertex set and the weights, edges are present independently with probability $p_{xy}=1-\exp{-λW_xW_y/|x-y|α}$. Assuming Pareto-type weight tails with index $β>0$ and working in parameter ranges where degrees are almost surely finite, we study extremes and peaks over thresholds (POT) of edge lengths in a growing observation window. Our focus is the precise impact of the presence of (large) weights on edge lengths, captured through explicit scaling regimes and conditional POT limit theorems. Our main results identify a three-phase behavior governed by the weight-tail parameter $β$. We both deduce Fréchet-type limits for the maximum edge length itself and we reveal POT structures under a hub conditioning by proving a POT limit theorem. In the finite-mean regime $β>1$, the leading scaling agrees with the unweighted model up to a constant. By contrast, for $β\le 1$ the weights have a macroscopic effect on extreme edge lengths: for $β< 1$ the scaling changes, and the borderline case $β=1$ exhibits additional logarithmic corrections. The proofs combine Stein-type Poisson approximation via a Palm-coupling approach with a refined treatment of the dependence created by the conditioning event.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.