Bayesian Networks for Max-linear Models
Not on the map. Why?
Abstract (arXiv)
We study Bayesian networks based on max-linear structural equations as introduced in Gissibl and Kl"uppelberg [16] and provide a summary of their independence properties. In particular we emphasize that distributions for such networks are generally not faithful to the independence model determined by their associated directed acyclic graph. In addition, we consider some of the basic issues of estimation and discuss generalized maximum likelihood estimation of the coefficients, using the concept of a generalized likelihood ratio for non-dominated families as introduced by Kiefer and Wolfowitz [21]. Finally we argue that the structure of a minimal network asymptotically can be identified completely from observational data.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 13 Jan 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 1.
3 papers.
- 2021Estimating a Directed Tree for Extremescited by 5
- 2021Spectral learning of multivariate extremescited by 3
- 2025Inference for max-linear Bayesian networks with noisecited by 1
- 2025Inference for max-linear Bayesian networks with noise1 May 2025
- 2021Spectral learning of multivariate extremes15 Nov 2021
- 2021Estimating a Directed Tree for Extremes11 Feb 2021