Revisiting Madigan and Mosurski: collapsibility via minimal separators
Biometrika · 06.07.2026 · 113 (3)
DOI: 10.1093/biomet/asag024 ↗Kurz gefasst
Fachartikel in der Zeitschrift Biometrika, online erschienen am 13.04.2026. Verfasst von Pei Heng und 3 weiteren Autor:innen. Die Arbeit nennt 10 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Collapsibility provides a principled approach to dimension reduction in contingency tables and graphical models. Madigan & Mosurski (1990) pioneered the study of minimal collapsible sets in decomposable models, but existing algorithms for general graphs remain computationally demanding. We show that a model is collapsible on to a target set precisely when that set contains at least one minimal separator between its nonadjacent vertices. This insight motivates the close minimal separator absorption algorithm, which constructs minimal collapsible sets using only local separator searches at very low costs. Simulations confirm substantial efficiency gains, making collapsibility analysis practical in high-dimensional settings.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Heng, P., He, S., Sun, Y., & Guo, J. (2026). Revisiting Madigan and Mosurski: collapsibility via minimal separators. Biometrika, 113(3). https://doi.org/10.1093/biomet/asag024
Vancouver
Heng P, He S, Sun Y, Guo J. Revisiting Madigan and Mosurski: collapsibility via minimal separators. Biometrika. 2026;113(3). doi:10.1093/biomet/asag024
BibTeX
@article{Heng2026,
author = {Heng, Pei and He, Shiyuan and Sun, Yi and Guo, Jianhua},
title = {Revisiting Madigan and Mosurski: collapsibility via minimal separators},
journal = {Biometrika},
year = {2026},
volume = {113},
number = {3},
doi = {10.1093/biomet/asag024}
}
EUVIMED