Metraipolis › archive › dc_bef7b35d0dad
Graphical Models Induced by Irreversible Event Accumulation on Trees — arXiv:2610.40127
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40127
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:31:20.788Z
- SHA-256 of the archived text
b0869be5f963ba7badea1a1eb614571b569d6aff5cd904b773037550865689b0- Stable URL of this page
https://metraipolis.com/documento/dc_bef7b35d0dad
How to cite
Graphical Models Induced by Irreversible Event Accumulation on Trees — arXiv:2610.40127 — arXiv (en), https://arxiv.org/abs/2610.40127 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bef7b35d0dad (Metraipolis archive dc_bef7b35d0dad, sha256 b0869be5f963ba7badea1a1eb614571b569d6aff5cd904b773037550865689b0)
BibTeX
@misc{dcbef7b35d0dad,
title = {Graphical Models Induced by Irreversible Event Accumulation on Trees — arXiv:2610.40127},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40127},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bef7b35d0dad; sha256 b0869be5f963ba7badea1a1eb614571b569d6aff5cd904b773037550865689b0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40127. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Decomposable graphical models are usually adopted for their computational convenience rather than derived from a data-generating mechanism. We show that a special class of them arises naturally from the irreversible accumulation of events along a branching history. Each event is attached to an edge of a latent rooted tree and is inherited by everything below that edge; an observation records which events have occurred at a randomly chosen node, not necessarily a leaf. When the tree is a path, this is the cumulative coding of an ordinal variable, whose indicators form a Markov chain; in the general tree case the Markov chain is replaced by a junction tree. The conditional independence graph of the event indicators is always decomposable and, in fact, is the line graph of the tree (maximal cliques correspond to nodes where two or more edges meet and separators are the single events on the edges joining two such nodes). The graph determines the tree up to the choice of root. A connected graph arises in this way if, and only if, it is chordal, any two of its maximal cliques share at most one vertex, no vertex is in three maximal cliques, and the graph is such that any two maximal cliques share at most one vertex. This provides a simple graphical test for compatibility with the mechanism (necessary but not sufficient, as irreversibility also constrains the distribution's support). The structure breaks down if we look at just the leaves, and measurement error destroys the exact screening and leads to a denser graph rather than simply a weaker dependence. We discuss inference, provide diagnostics for departures such as recurrent events, illustrate them on some simulated data and discuss their application in the context of mutation accumulation and lineage tracing where both ancestral and descendant types are sampled together. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno). Categorie arXiv: Statistics Theory (math.ST) ; Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2610.40127 — 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-11-01T02:13:44.003Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).