A prior distribution for the underlying graph is introduced in the framework of Gaussian graphical models. Such a prior distribution induces a block structure in the graph's adjacency matrix, allowing learning relationships between fixed groups of variables. A novel sampling strategy named Double Reversible Jumps Markov chain Monte Carlo is developed for learning block structured graphs under the conjugate G-Wishart prior. The algorithm proposes moves that add or remove not just a single edge of the graph but an entire group of edges. The method is then applied to smooth functional data. The classical smoothing procedure is improved by placing a graphical model on the basis expansion coefficients, providing an estimate of their conditional dependence structure. Since the elements of a B-Spline basis have compact support, the conditional dependence structure is reflected on well-defined portions of the domain. A known partition of the functional domain is exploited to investigate relationships among portions of the domain and improve the interpretability of the results. for this article are available online.

Colombi, A., Argiento, R., Paci, L., Pini, A., Learning Block Structured Graphs in Gaussian Graphical Models, <<JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS>>, N/A; (N/A): 1-14. [doi:10.1080/10618600.2023.2210184] [https://hdl.handle.net/10807/243456]

### Learning Block Structured Graphs in Gaussian Graphical Models

#### Abstract

A prior distribution for the underlying graph is introduced in the framework of Gaussian graphical models. Such a prior distribution induces a block structure in the graph's adjacency matrix, allowing learning relationships between fixed groups of variables. A novel sampling strategy named Double Reversible Jumps Markov chain Monte Carlo is developed for learning block structured graphs under the conjugate G-Wishart prior. The algorithm proposes moves that add or remove not just a single edge of the graph but an entire group of edges. The method is then applied to smooth functional data. The classical smoothing procedure is improved by placing a graphical model on the basis expansion coefficients, providing an estimate of their conditional dependence structure. Since the elements of a B-Spline basis have compact support, the conditional dependence structure is reflected on well-defined portions of the domain. A known partition of the functional domain is exploited to investigate relationships among portions of the domain and improve the interpretability of the results. for this article are available online.
##### Scheda breve Scheda completa Scheda completa (DC)
2023
Inglese
Colombi, A., Argiento, R., Paci, L., Pini, A., Learning Block Structured Graphs in Gaussian Graphical Models, <<JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS>>, N/A; (N/A): 1-14. [doi:10.1080/10618600.2023.2210184] [https://hdl.handle.net/10807/243456]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/10807/243456`
• ND
• 0
• 0