Hidden regular variation for stochastic recursions with diagonal matrices
Ewa Damek, Sebastian Mentemeier

TL;DR
This paper investigates the hidden regular variation in stochastic recursions with diagonal matrices, revealing how to identify simultaneous extreme events despite apparent asymptotic independence.
Contribution
It introduces a novel analysis of hidden regular variation in stochastic recursions, extending understanding of tail behavior under dependence structures.
Findings
Identifies the proper scaling for observing simultaneous extremes.
Shows the tail measure concentrates on the axes despite asymptotic independence.
Provides a framework for analyzing joint tail behavior in recursive models.
Abstract
We consider random vectors that satisfy the equation in law , where is a given random diagonal matrix and a given random vector, both independent of . It is well known by the works of Kesten and Goldie that the marginals of may exhibit heavy tails, with possibly different tail indices. In recent works (Damek 2025, Mentemeier and Wintenberger 2022) it was observed that asymptotic independence may occur despite strong dependencies in the entries of : The probability that both marginals are simultaneously large decays faster than the marginal probability of an extreme event; the tail measure is concentrated on the axis. In this work, we analyse the hidden regular variation properties of , that is, we find the proper scaling for which one observes simultaneous extremes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
