Metraipolis › archive › dc_f9af28ba9ec2
Auditing Bayesian Graph Alignment: Diagnostic Comparisons and Reference Failure — arXiv:2609.23232
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23232
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:08:27.341Z
- SHA-256 of the archived text
752a60856e61b6cae51404cfcef527738180e8ca22273949e8a60933a2b5343c- Stable URL of this page
https://metraipolis.com/documento/dc_f9af28ba9ec2
How to cite
Auditing Bayesian Graph Alignment: Diagnostic Comparisons and Reference Failure — arXiv:2609.23232 — arXiv (en), https://arxiv.org/abs/2609.23232 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f9af28ba9ec2 (Metraipolis archive dc_f9af28ba9ec2, sha256 752a60856e61b6cae51404cfcef527738180e8ca22273949e8a60933a2b5343c)
BibTeX
@misc{dcf9af28ba9ec2,
title = {Auditing Bayesian Graph Alignment: Diagnostic Comparisons and Reference Failure — arXiv:2609.23232},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23232},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f9af28ba9ec2; sha256 752a60856e61b6cae51404cfcef527738180e8ca22273949e8a60933a2b5343c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23232. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Bayesian graph alignment estimates correspondence probabilities, but convergence of an alignment-score trace need not imply accurate correspondence marginals. We audit this gap on 240 new exact graph pairs from four source families, 240 larger pairs with 20-100 vertices, and a separate 60-case exact implementation check. Under an explicit edge-flip likelihood, we compare three samplers and score, marginal, indicator, categorical, and classifier-based diagnostics. Marginal disagreement improves error discrimination over score R-hat for the exact informed sampler, but its improvement for vanilla local sampling is uncertain. Assignment-based R* and short indicator panels are competitive; no diagnostic dominates across samplers and endpoints. At larger sizes, diagnostics predict subsequent marginal changes, not posterior error, and classification performance depends on the drift threshold. Disjoint-window and held-out-chain checks attenuate but preserve positive associations. Only 22 of 240 original reference sets pass an agreement screen. On forty failure-selected cases, eightfold SMC particle escalation does not resolve disagreement, whereas additional rejuvenation helps. Longer informed runs remain unstable. An elementary feasible-alignment bound demonstrates severely unrepresentative SMC and informed-chain scores in concentrated 100-vertex cases, independently of approximate reference consensus. We also exhibit common-start chains with near-zero disagreement despite exact marginal error near .967. These results support assignment-sensitive auditing while identifying limits of finite budgets, diagnostic rankings, and reference agreement as evidence of accuracy. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LG). Categorie arXiv: Applications (stat.AP) ; Machine Learning (cs.LG); Computation (stat.CO); Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2609.23232 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T06:58:09.568Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).