We study the problem of maximum likelihood estimation of densities that are log-concave and lie in the graphical model corresponding to a given
undirected graph
The repository contains two folders
- "Compute log-concave graphical MLE in R", which contains the implementation of the optmization algorithm presented in Section 6 of the corresponding paper. The necessary functions are contained in the file "functions.R", which are then called by "log-concave_graphical_MLE.R". One needs to add the path to "functions.R" on line 18 of "log-concave_graphical_MLE.R". To facilitate replication, we also include the data that was used in Example 6.1 (folder "Graph_12") and Example 6.2 ("Graph_12-23"). The computations are performed in R.
- "Compute support of log-concave graphical MLE in Macaulay2", which contain the code for studying whether the special sets
$D_G^{(i)}$ converge to the support of the MLE for non-chordal graphs as discussed in Conjecture 2.11. The file "support_MLE_functions.m2" includes the declarations of all relevant functions that are called inside "support_MLE.m2" for the computation of the support of a 4-cycle. Both files should be placed in the same folder. The computations are performed in the Macaulay2.
Kubjas, K., Kuznetsova, O., Robeva, E., Semnani, P., & Sodomaco, L. (2022). Log-concave density estimation in undirected graphical models. arXiv preprint arXiv:2206.05227.
The authors thank Joshua Boyd for improving the implementation of the optimisation function in the code.