Variants of the graph dependent model in extreme value theory

With a set X₁, X₂, .... X_n n random variables, a graph is associated whose vertices are the integers 1,2,..., n and whose edges represent those pairs i and j for which the events {X_i>X} and {X_j>X} do not become “almost independent” for “large X”. With a variety of assumption on the edge set of the graph, the asymptotic distribution of the extremes of the X_j, when properly normalized, is determined. This refines the earlier result of the present author on this kind of dependence, and extends and unifies several known dependent extreme value models.