Extremes on Trees

Abstract

This paper considers the asymptotic distribution of the longest edge of the minimal spanning tree and nearest neighbor graph on X1,...,XNn where X1,X2,... are i.i.d. in 2 with distribution F and Nn is independent of the Xi and satisfies Nn/np1. A new approach based on spatial blocking and a locally orthogonal coordinate system is developed to treat cases for which F has unbounded support. The general results are applied to a number of special cases, including elliptically contoured distributions, distributions with independent Weibull-like margins and distributions with parallel level curves.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…