scholarly journals Bayesian clustering in decomposable graphs

2011 ◽  
Vol 6 (4) ◽  
pp. 829-846 ◽  
Author(s):  
Luke Bornn ◽  
Francois Caron
Biometrics ◽  
2021 ◽  
Author(s):  
Henry R. Scharf ◽  
Ann M. Raiho ◽  
Sierra Pugh ◽  
Carl A. Roland ◽  
David K. Swanson ◽  
...  
Keyword(s):  

Ecography ◽  
2007 ◽  
Vol 30 (4) ◽  
pp. 526-536 ◽  
Author(s):  
J. Angus Webb ◽  
Nicholas R. Bond ◽  
Stephen R. Wealands ◽  
Ralph Mac Nally ◽  
Gerry P. Quinn ◽  
...  

2007 ◽  
Vol 35 (3) ◽  
pp. 1278-1323 ◽  
Author(s):  
Gérard Letac ◽  
Hélène Massam

Author(s):  
S. L. Lauritzen ◽  
T. P. Speed ◽  
K. Vijayan

AbstractWe define and investigate the notion of a decomposable hypergraph, showing that such a hypergraph always is conformal, that is, can be viewed as the class of maximal cliques of a graph. We further show that the clique hypergraph of a graph is decomposable if and only if the graph is triangulated and characterise such graphs in terms of a combinatorial identity.


2021 ◽  
Author(s):  
Denis Valle ◽  
Yusuf Jameel ◽  
Brenda Betancourt ◽  
Ermias T. Azeria ◽  
Nina Attias ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document