Estimating an Extreme Bayesian Network via Scalings
Not on the map. Why?
Abstract (arXiv)
Recursive max-linear vectors model causal dependence between its components by expressing each node variable as a max-linear function of its parental nodes in a directed acyclic graph and some exogenous innovation. Motivated by extreme value theory, innovations are assumed to have regularly varying distribution tails. We propose a scaling technique in order to determine a causal order of the node variables. All dependence parameters are then estimated from the estimated scalings. Furthermore, we prove asymptotic normality of the estimated scalings and dependence parameters based on asymptotic normality of the empirical spectral measure. Finally, we apply our structure learning and estimation algorithm to financial data and food dietary interview data.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Dec 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 1.
2 papers.
- 2021Estimating a Directed Tree for Extremescited by 5
- 2025Inference for max-linear Bayesian networks with noisecited by 1
- 2025Inference for max-linear Bayesian networks with noise1 May 2025
- 2021Estimating a Directed Tree for Extremes11 Feb 2021