Extremes of Markov random fields on block graphs

We study the joint occurrence of large values of a Markov random field or undirected graphical model associated to a block graph. On such graphs, containing trees as specialcases, we aim to generalize recent results for extremes of Markov trees. Every pair ofnodes in a block graph is connected by a unique shortest path. These paths are shownto determine the limiting distribution of the properly rescaled random field given that a fixed variable exceeds a high threshold. When the sub-vectors induced by the blocks follow Hüsler–Reiss extreme value copulas, the global Markov property of the original field induces a particular structure on the parameter matrix of the limiting max-stable Hüsler–Reiss distribution. The multivariate Pareto version of the latter turns out to be an extremal graphical model according to the original block graph. Moreover, thanks to these algebraic relations, the parameters are still identifiable even if some variables are latent