Methodology · arXiv:2611.17074 v1 · submitted 12 Nov 2026 · 51 references
GraphInfer: Statistical Inference for Decomposable Graphical Models in R
The paper says
“Decomposable graphical models combine closed-form maximum likelihood estimation with local model comparison, which makes structure inference practical with many variables.”
more of the abstract
The R package GraphInfer provides one likelihood framework for decomposable models of continuous, discrete and mixed data, the last as conditional Gaussian models. Structure inference ranges from exact minimum forests and stepwise search to stochastic global search. Nested models are compared by likelihood-ratio tests whose null distributions are exact in finite samples: conditionally on the discrete data for edges with a continuous endpoint, and conditionally on the discrete margins of the smaller model for edges between discrete variables. Missing values are handled by EM, by structural EM, which reuses complete-data searches through a weighted pseudo-sample of expected sufficient statistics, and by multiple imputation; selected models are fit to the observed-data likelihood. The package also treats the graphical models induced by irreversible event accumulation on trees: a search over the compatible graphs whose tree moves overcome an obstruction to single-edge moves, fitting of the full accumulation model with measurement noise and bootstrap tests of the accumulation hypothesis. GraphInfer is an independent, pure R successor to the archived package gRapHD. The implementation is validated against independent references, and simulation studies inform its defaults.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
The passes disagreed. Reader: holds up. Skeptic: holds up only with conditions. Referee: major revision.
A serious software paper with real novel bits and an honest limitations section, but the claimed exactness of the discrete-edge conditional test rests on a sampling justification that needs closer scrutiny. This line is wrong
5 major objections · 7 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 51 references say.
The paper says, at Section 5.3, Appendix C, Proposition 7
The review did not quote this passage.
Pith says: Objection 1 of 5 · major
The claim that the conditional test for discrete-discrete edges is exact relies on the assertion that the clique-by-clique Patefield scheme draws uniformly from the conditional distribution given the clique margins of the smaller model. The description of the sampler (Appendix C, proof of Proposition 7(b)) is insufficient to justify this.
more of objection 1
The clique margins of a decomposable log-linear model are not independent across cliques, and a sequential conditional-uniform assignment does not in general produce a uniform draw from the correct conditional distribution. The paper cites Patefield (1981) for the two-way case, but the extension to multi-way decomposable margins is non-trivial and is not argued or referenced. This is a load-bearing issue because the exactness of the discrete-discrete edge test is a central advertised feature. The authors should provide a rigorous justification or a reference that establishes the uniformity of the described sampler for decomposable margins.
The paper says, at Section 9.4, Table 11
The review did not quote this passage.
Pith says: Objection 2 of 5 · major
The simulation study of the exact tests' level (Table 11) shows that the exact test holds its level, but the study is limited in scope. For the discrete-discrete edge test, the design involves only three discrete variables with small numbers of levels.
more of objection 2
The study does not examine scenarios with more complex discrete structures or larger numbers of variables, where the conditional test's exactness might be more challenging to maintain. The authors should discuss the limitations of the simulation evidence and ideally provide additional simulations or theoretical justification for the test's validity in broader settings.
The paper says, at Section 7.3, Table 4, Section 9.5
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.95):
“These figures concern few configurations and replicates: they show no substantial calibration problem when the fitted model is well determined, and the test should not be regarded as calibrated in general.”
Pith says: Objection 3 of 5 · major
The calibration study of the accumulation test (Section 9.5) is acknowledged to be limited ('These figures concern few configurations and replicates: they show no substantial calibration problem when the fitted model is well determined, and the test should not be regarded as calibrated in general.').
more of objection 3
This is an honest limitation, but it means that the test's reliability in practice is uncertain. The paper should provide clearer guidance on when the test can be trusted and perhaps suggest diagnostic checks for boundary estimates.
The paper says, at Section 6.2, structural EM
The review did not quote this passage.
Pith says: Objection 4 of 5 · major
The structural EM method uses a weighted pseudo-sample based on the unscented transform to reproduce expected sufficient statistics. The paper claims that this pseudo-sample is exact for the expected criterion. However, the unscented transform is designed for capturing the mean and covariance of a distribution, not necessarily all higher-order moments that might be relevant for discrete data or for the likelihood of a graphical model.
more of objection 4
The authors should justify why the 2q-point symmetric set is sufficient for the exact reproduction of the expected sufficient statistics for all vertex sets, especially in the mixed data case with discrete variables.
The paper says, at Section 5.3, Proposition 6
The review did not quote this passage.
Pith says: Objection 5 of 5 · major
The proof of independence of step statistics in Proposition 6 relies on Basu's theorem and the completeness of the sufficient statistic for the conditional Gaussian family given the discrete data. The paper states that the family is a regular exponential family of full rank, but this requires that the parameter space is open and the sufficient statistic is complete.
more of objection 5
In the heterogeneous model, the covariance matrices can vary across cells, and the parameter space may have boundaries (e.g., positive definiteness). The authors should verify that the completeness argument holds under the stated conditions, especially when some cell probabilities are estimated at zero (boundary of the parameter space).
7 minor objections
The paper says, at General
Pith says: minor objection 1 of 7
The paper is well-written and comprehensive. The package appears to be a significant contribution to the R ecosystem for graphical models.
The paper says, at Section 3.2
Pith says: minor objection 2 of 7
The definition of the dimension for the heterogeneous model (dhet) includes a term for the covariance matrix per cell. It might be helpful to clarify that the number of parameters for each covariance matrix is gA(gA+1)/2, and that this is summed over occupied cells.
show 5 more
The paper says, at Section 5.3
Pith says: minor objection 3 of 7
The description of the exact test for discrete-discrete edges could be clearer. The paper mentions that the test conditions on the margins of the cliques of G0[Δ], but it is not immediately obvious how this conditioning is implemented in practice. A brief explanation of the algorithm would be helpful.
The paper says, at Section 8.2, Table 5
Pith says: minor objection 4 of 7
Table 5 compares forward and backward search results. It would be useful to also include the results of the global search from multiple starts to show the variability.
The paper says, at Section 9.1
Pith says: minor objection 5 of 7
The comparison of the fast and classic stepwise engines is convincing. The paper should mention that the fast engine is the default and that the classic engine is available for verification.
The paper says, at Section 9.6
Pith says: minor objection 6 of 7
The simulation study on missing data is thorough. The paper could discuss the computational cost of the two-stage structural EM more explicitly, as it is mentioned only in passing.
The paper says, at Appendix C
Pith says: minor objection 7 of 7
The proof of Proposition 7(b) is sketchy. The statement 'every completion is equally likely' is asserted without proof. The authors should provide a more detailed argument or a reference that establishes the uniformity of the sampler for decomposable margins.
What would settle it
Implement a brute-force enumeration for a small but non-trivial decomposable log-linear model (e.g., three binary variables with graph A—B—C, so clique margins are AB and BC). Enumerate all 2x2x2 tables with given AB and BC margins (say, each margin has row sums (5,5) and column sums (5,5), so total n=10). Compute the exact conditional distribution of the table under the model (uniform over tables with those margins? Actually the model is log-linear, so the conditional distribution given the margins is uniform only if the model is the saturated one on the margins; for a decomposable model the conditional distribution given the clique margins is not uniform over tables—it is uniform over the set of tables consistent with those margins only under the null of no three-way interaction?
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up
- Skeptic disagrees: says it holds up only with conditions Exactness of the conditional test for discrete–discrete edges relies on a uniform-sampling claim that is not fully justified for the clique-by-clique Patefield scheme described.
- Editor wrote the verdict above
- Referee major revision: 5 major objections, 7 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
This is a careful, well-tested R package that fills the gap left by the archived gRapHD and adds genuinely useful machinery: the weighted pseudo-sample for structural EM in conditional Gaussian models, the obstruction result for tree moves, and the full accumulation model with noise. The validation is exemplary—closed-form checks, independent references, full enumeration for small cases, and a test suite with 13,724 expectations. The simulation studies are honest, including the calibration limits of the bootstrap tests. Credit where due: this is not a toy; the author has done the engineering and the statistics seriously.
The paper is upfront about most of its soft spots: the MAR assumption is standard and acknowledged, the global search gives no optimality certificate, and the bootstrap tests are not calibrated beyond the studied configurations. Those are fine.
The one place I would push back is the exactness claim for discrete–discrete edges. The stress-test note lands: Proposition 7(b) says the conditional distribution of the discrete data given the clique margins is uniform on all sequences with those margins, and the clique-by-clique Patefield sampling draws from it. That uniform claim is not obviously true. The clique margins of a decomposable log-linear model are not variation-independent across cliques, and a sequential conditional-uniform assignment does not in general produce a uniform draw from the correct conditional distribution. The proof jumps from 'every completion is equally likely' to the uniform claim without demonstrating that the sequential scheme preserves uniformity. For a two-way table, Patefield's algorithm works, but the multi-way decomposable extension is nontrivial and the paper does not justify it. If that step fails, the claimed exactness of the discrete-edge tests would be compromised, and the level of those tests in Section 9.4 would be empirical rather than exact.
That said, the empirical level results look fine, and the continuous-endpoint tests are on solid ground (the proofs in Appendix C are careful and complete). The discrete-edge issue is a genuine concern but still testable—the author could simulate from the conditional distribution with an independent exact sampler and compare. I would not desk-reject over it, but I would want a referee to check it thoroughly.
This is a paper for statistical software users and developers: methodologically conservative, honest about limitations, and with a real contribution to the field. It deserves serious peer review.
The strongest objection
The paper claims (Proposition 7, Section 5.3, Appendix C) that the conditional test for edges between discrete variables is exact because the discrete data are drawn uniformly from all sequences with the same clique margins of the smaller model, using Patefield's algorithm applied clique by clique. The description says: 'the sampler keeps the first clique and, for each later clique C_j with separator S_j and R_j = C_j \ S_j, assigns the observed values of R_j within each cell of S_j to the observations of that cell in random order.' This is not obviously equivalent to drawing uniformly from the conditional distribution given the clique margins of G_0[Δ]. The clique margins of a decomposable log-linear model are not independent across cliques; the joint distribution of the table given those margins is not generally uniform over all tables with those margins, and a sequential conditional-uniform assignment does not in general produce a uniform draw from the correct conditional distribution. The paper cites Patefield (1981) for the two-way case, but the extension to multi-way decomposable margins is non-trivial and is not argued or referenced. The claim that 'every completion is equally likely' (Appendix C, proof of Proposition 7(b)) is asserted without proof and is not obviously true for the described algorithm. If this claim fails, the p-values for discrete–discrete edges are not exact, which undermines a central advertised feature (exact finite-sample tests). The paper acknowledges that the test does not account for selection (Section 10), but that is a separate issue; the concern here is about the claimed exactness of the conditional test itself.
The reader's verdict is ACCEPT with high confidence, and the weakest assumption identified is the MAR assumption for missing data. I disagree: the most load-bearing concern is the unsupported claim of exactness for the conditional test for discrete–discrete edges. The paper states that the p-value is exact conditionally on the margins, but the algorithm described (clique-by-clique Patefield) is not justified and likely does not produce a uniform draw from the correct conditional distribution. This is a technical flaw in the central claim of exact finite-sample tests. The MAR assumption is acknowledged and standard; the discrete test exactness is presented as a novel contribution (Proposition 7) and is not standard. The paper's own validation (Table 11) only checks level for a specific design (three discrete variables, two continuous) and does not test the discrete–discrete edge test in isolation; the row 'Discrete, n=40' tests two discrete edges jointly, but the test is conditional on the margins and the paper reports exact level. However, the simulation may have used the same algorithm, so it would not detect a flaw if the algorithm is wrong but the level holds by coincidence for that particular configuration. A more thorough check would be needed. The paper does not provide a proof that the clique-by-clique permutation yields a uniform draw from the conditional distribution given the clique margins; the argument in Appendix C is insufficient. Therefore the claim of exactness is not adequately supported, and the paper should be CONDITIONAL on providing a correct justification or correction.
The referee's report
If the claims hold, GraphInfer provides a unified and computationally efficient framework for decomposable graphical models, with exact tests and missing data capabilities, which could be valuable for practitioners. The package is a successor to the archived gRapHD and offers additional features like global search and accumulation tree models.
Pith's reading of the paper (a machine's summary, not the authors')
GraphInfer is an R package for analyzing decomposable graphical models. These models are a special class of undirected graphical models where the graph is chordal, meaning it has no cycles of length four or more without a chord. This property allows for closed-form maximum likelihood estimation and local model comparison, making structure inference practical even with many variables. The package handles continuous (Gaussian), discrete, and mixed data (conditional Gaussian models). It provides a range of structure inference methods: exact minimum forests (Chow-Liu trees), stepwise search, and stochastic global search. Nested models are compared using likelihood-ratio tests, and for certain edges the null distribution is exact in finite samples, not just asymptotic. Missing values are handled via EM, structural EM (which reuses complete-data searches through a weighted pseudo-sample), and multiple imputation. The package also includes specialized models for irreversible event accumulation on trees, where the graph is induced by a tree structure. This includes a search over compatible graphs using tree moves that overcome an obstruction to single-edge moves, fitting of the full accumulation model with measurement noise, and bootstrap tests of the accumulation hypothesis. The package is validated against independent references and simulation studies inform its defaults.
Core claim. GraphInfer provides a unified likelihood framework for decomposable graphical models (Gaussian, discrete, and conditional Gaussian) that enables structure inference (exact minimum forests, stepwise, global search), exact finite-sample likelihood-ratio tests for certain edges, missing data handling (EM, structural EM, multiple imputation), and models for irreversible event accumulation on trees, all within a single R package that is validated against independent references.
The premise it rests on. The assumption that the missing data are missing at random (MAR) with distinct parameters (ignorable missingness) is stated in Section 6 and used for all missing data procedures. This is a strong assumption that cannot be verified from the data and is critical for the validity of the EM, structural EM, and imputation methods. The paper acknowledges this assumption but does not provide sensitivity analyses or methods for non-ignorable missingness.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Decomposable graphical models combine closed-form maximum likelihood estimation with local model comparison, which makes structure inference practical with many variables. The R package GraphInfer provides one likelihood framework for decomposable models of continuous, discrete and mixed data, the last as conditional Gaussian models. Structure inference ranges from exact minimum forests and stepwise search to stochastic global search. Nested models are compared by likelihood-ratio tests whose null distributions are exact in finite samples: conditionally on the discrete data for edges with a continuous endpoint, and conditionally on the discrete margins of the smaller model for edges between discrete variables. Missing values are handled by EM, by structural EM, which reuses complete-data searches through a weighted pseudo-sample of expected sufficient statistics, and by multiple imputation; selected models are fit to the observed-data likelihood. The package also treats the graphical models induced by irreversible event accumulation on trees: a search over the compatible graphs whose tree moves overcome an obstruction to single-edge moves, fitting of the full accumulation model with measurement noise and bootstrap tests of the accumulation hypothesis. GraphInfer is an independent, pure R successor to the archived package gRapHD. The implementation is validated against independent references, and simulation studies inform its defaults.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-14
The authors' main claim, as the classifier picked it out 0.37
“The implementation is validated against independent references, and simulation studies inform its defaults.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.12 · human participants 0.04 · controlled comparison 0.05 · randomized assignment 0.01 · states quantitative result 0.05 · compares with prior results 0.38 · mentions code or data availability 0.59
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Decomposable graphical models combine closed-form maximum likelihood estimation with local model comparison, which makes structure inference practical with many variables. | background 1.00 | 0.07 | 0.18 | asserted 1.00 |
| The R package GraphInfer provides one likelihood framework for decomposable models of continuous, discrete and mixed data, the last as conditional Gaussian models. | contribution 0.95 | 0.71 | 0.12 | asserted 1.00 |
| Structure inference ranges from exact minimum forests and stepwise search to stochastic global search. | method 0.87 | 0.47 | 0.07 | asserted 1.00 |
| Nested models are compared by likelihood-ratio tests whose null distributions are exact in finite samples: conditionally on the discrete data for edges with a continuous endpoint, and conditionally on the discrete margins of the smaller model for edges between discrete variables. | method 0.99 | 0.73 | 0.08 | asserted 1.00 |
| Missing values are handled by EM, by structural EM, which reuses complete-data searches through a weighted pseudo-sample of expected sufficient statistics, and by multiple imputation; selected models are fit to the observed-data likelihood. | method 0.98 | 0.75 | 0.05 | asserted 1.00 |
| The package also treats the graphical models induced by irreversible event accumulation on trees: a search over the compatible graphs whose tree moves overcome an obstruction to single-edge moves, fitting of the full accumulation model with measurement noise and bootstrap tests of the accumulation hypothesis. | contribution 0.85 | 0.81 | 0.07 | asserted 1.00 |
| GraphInfer is an independent, pure R successor to the archived package gRapHD. | contribution 0.60 | 0.54 | 0.06 | asserted 1.00 |
| The implementation is validated against independent references, and simulation studies inform its defaults. | method 0.52 | 0.87 | 0.08 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.93
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-14: 1 request, 6,291 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (2)
Figures are the authors', reproduced from the paper.
References (51)
- [1] Abreu, G. C. G., Edwards, D. and Labouriau, R. (2010). High-dimensional graphical model search with the gRapHD R package. Journal of Statistical Software 37(1), 1--18. doi:10.18637/jss.v037.i01 on Pithdoi:10.18637/jss.v037.i01
- [2] Aeberhard, S. and Forina, M. (1992). Wine [data set]. UCI Machine Learning Repository. doi:10.24432/C5PC7J on Pithdoi:10.24432/c5pc7j
- [3] Akaike, H. (1974). A new look at the statistical model identification. IEEE Transactions on Automatic Control 19(6), 716--723. doi:10.1109/TAC.1974.1100705 on Pithdoi:10.1109/tac.1974.1100705
- [4] Anderson, T. W. (2003). An Introduction to Multivariate Statistical Analysis, 3rd ed. Wiley-Interscience, Hoboken, NJ on Pith
- [5] Basu, D. (1955). On statistics independent of a complete sufficient statistic. Sankhy\= a 15(4), 377--380 on Pith
- [6] Beerenwinkel, N., Eriksson, N. and Sturmfels, B. (2007). Conjunctive Bayesian networks. Bernoulli 13(4), 893--909. doi:10.3150/07-BEJ6133 on Pithdoi:10.3150/07-bej6133
- [7] Chen, J. and Chen, Z. (2008). Extended Bayesian information criteria for model selection with large model spaces. Biometrika 95(3), 759--771. doi:10.1093/biomet/asn034 on Pithdoi:10.1093/biomet/asn034
- [8] Chow, C. K. and Liu, C. N. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory 14(3), 462--467. doi:10.1109/TIT.1968.1054142 on Pithdoi:10.1109/tit.1968.1054142
- [9] Davidson, R. and MacKinnon, J. G. (2007). Improving the reliability of bootstrap tests with the fast double bootstrap. Computational Statistics & Data Analysis 51(7), 3259--3281. doi:10.1016/j.csda.2006.04.001 on Pithdoi:10.1016/j.csda.2006.04.001
- [10] Davison, A. C. and Hinkley, D. V. (1997). Bootstrap Methods and their Application. Cambridge University Press, Cambridge on Pith
- [11] Dempster, A. P., Laird, N. M. and Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B (Methodological) 39(1), 1--38. doi:10.1111/j.2517-6161.1977.tb01600.x on Pithdoi:10.1111/j.2517-6161.1977.tb01600.x
- [12] Desper, R., Jiang, F., Kallioniemi, O.-P., Moch, H., Papadimitriou, C. H. and Sch\"affer, A. A. (1999). Inferring tree models for oncogenesis from comparative genome hybridization data. Journal of Computational Biology 6(1), 37--51. doi:10.1089/cmb.1999.6.37 on Pithdoi:10.1089/cmb.1999.6.37
- [13] Dethlefsen, C. and H jsgaard, S. (2005). A common platform for graphical models in R : The gRbase package. Journal of Statistical Software 14(17), 1--12. doi:10.18637/jss.v014.i17 on Pithdoi:10.18637/jss.v014.i17
- [14] Detrano, R., Janosi, A., Steinbrunn, W., Pfisterer, M., Schmid, J.-J., Sandhu, S., Guppy, K. H., Lee, S. and Froelicher, V. (1989). International application of a new probability algorithm for the diagnosis of coronary artery disease. The American Journal of Cardiology 64(5), ... on Pithdoi:10.1016/0002-9149(89)90524-9
- [15] Drton, M. and Plummer, M. (2017). A Bayesian information criterion for singular models. Journal of the Royal Statistical Society, Series B (Statistical Methodology) 79(2), 323--380. doi:10.1111/rssb.12187 on Pithdoi:10.1111/rssb.12187
- [16] Edwards, D. (2000). Introduction to Graphical Modelling, 2nd ed. Springer-Verlag, New York on Pith
- [17] Edwards, D., de Abreu, G. C. G. and Labouriau, R. (2010). Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests. BMC Bioinformatics 11, 18. doi:10.1186/1471-2105-11-18 on Pithdoi:10.1186/1471-2105-11-18
- [18] Efron, B. (1994). Missing data, imputation, and the bootstrap. Journal of the American Statistical Association 89(426), 463--475. doi:10.1080/01621459.1994.10476768 on Pithdoi:10.1080/01621459.1994.10476768
- [19] Fienberg, S. E. and Rinaldo, A. (2012). Maximum likelihood estimation in log-linear models. The Annals of Statistics 40(2), 996--1023. doi:10.1214/12-AOS986 on Pithdoi:10.1214/12-aos986
- [20] Fiorini, S. (2016). Gene expression cancer RNA-Seq [data set]. UCI Machine Learning Repository. doi:10.24432/C5R88H on Pithdoi:10.24432/c5r88h
show 31 more
- [21] Foygel, R. and Drton, M. (2010). Extended Bayesian information criteria for Gaussian graphical models. In Advances in Neural Information Processing Systems 23, pp. 604--612. arXiv:1011.6640 on PithPith's reviewarXiv
- [22] Friedman, N. (1997). Learning belief networks in the presence of missing values and hidden variables. In D. H. Fisher (ed.), Proceedings of the Fourteenth International Conference on Machine Learning (ICML 1997), pp. 125--133. Morgan Kaufmann, San Francisco on Pith
- [23] Friedman, N. (1998). The Bayesian structural EM algorithm. In G. F. Cooper and S. Moral (eds.), Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI '98), pp. 129--138. Morgan Kaufmann, San Francisco on Pith
- [24] Friedman, J., Hastie, T. and Tibshirani, R. (2008). Sparse inverse covariance estimation with the graphical lasso. Biostatistics 9(3), 432--441. doi:10.1093/biostatistics/kxm045 on Pithdoi:10.1093/biostatistics/kxm045
- [25] Frydenberg, M. (1990). Marginalization and collapsibility in graphical interaction models. The Annals of Statistics 18(2), 790--805. doi:10.1214/aos/1176347626 on Pithdoi:10.1214/aos/1176347626
- [26] Frydenberg, M. and Lauritzen, S. L. (1989). Decomposition of maximum likelihood in mixed graphical interaction models. Biometrika 76(3), 539--555. doi:10.1093/biomet/76.3.539 on Pithdoi:10.1093/biomet/76.3.539
- [27] Gerstung, M., Baudis, M., Moch, H. and Beerenwinkel, N. (2009). Quantifying cancer progression with conjunctive Bayesian networks. Bioinformatics 25(21), 2809--2815. doi:10.1093/bioinformatics/btp505 on Pithdoi:10.1093/bioinformatics/btp505
- [28] Giudici, P. and Green, P. J. (1999). Decomposable graphical Gaussian model determination. Biometrika 86(4), 785--801. doi:10.1093/biomet/86.4.785 on Pithdoi:10.1093/biomet/86.4.785
- [29] Gusfield, D. (1991). Efficient algorithms for inferring evolutionary trees. Networks 21(1), 19--28. doi:10.1002/net.3230210104 on Pithdoi:10.1002/net.3230210104
- [30] H jsgaard, S., Edwards, D. and Lauritzen, S. (2012). Graphical Models with R . Springer, New York. doi:10.1007/978-1-4614-2299-0 on Pithdoi:10.1007/978-1-4614-2299-0
- [31] Honaker, J. and King, G. (2010). What to do about missing values in time-series cross-section data. American Journal of Political Science 54(2), 561--581. doi:10.1111/j.1540-5907.2010.00447.x on Pithdoi:10.1111/j.1540-5907.2010.00447.x
- [32] Janosi, A., Steinbrunn, W., Pfisterer, M. and Detrano, R. (1989). Heart disease [data set]. UCI Machine Learning Repository. doi:10.24432/C52P4X on Pithdoi:10.24432/c52p4x
- [33] Julier, S. J. and Uhlmann, J. K. (2004). Unscented filtering and nonlinear estimation. Proceedings of the IEEE 92(3), 401--422. doi:10.1109/JPROC.2003.823141 on Pithdoi:10.1109/jproc.2003.823141
- [34] Kirkpatrick, S., Gelatt, C. D., Jr., and Vecchi, M. P. (1983). Optimization by simulated annealing. Science 220(4598), 671--680. doi:10.1126/science.220.4598.671 on Pithdoi:10.1126/science.220.4598.671
- [35] Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7(1), 48--50. doi:10.1090/S0002-9939-1956-0078686-7 on Pithdoi:10.1090/s0002-9939-1956-0078686-7
- [36] Labouriau, R. (2026). Graphical models induced by irreversible event accumulation on trees. arXiv:2610.40127 [math.ST]. doi:10.48550/arXiv.2610.40127 on PithPith's reviewarXivdoi:10.48550/arxiv.2610.40127
- [37] Lauritzen, S. L. (1995). The EM algorithm for graphical association models with missing data. Computational Statistics & Data Analysis 19(2), 191--201. doi:10.1016/0167-9473(93)E0056-A on Pithdoi:10.1016/0167-9473(93)e0056-a
- [38] Lauritzen, S. L. (1996). Graphical Models. Oxford University Press, Oxford on Pith
- [39] Lauritzen, S. L. and Wermuth, N. (1989). Graphical models for associations between variables, some of which are qualitative and some quantitative. The Annals of Statistics 17(1), 31--57. doi:10.1214/aos/1176347003 on Pithdoi:10.1214/aos/1176347003
- [40] Lehmann, E. L. and Romano, J. P. (2005). Testing Statistical Hypotheses, 3rd ed. Springer, New York. doi:10.1007/0-387-27605-X on Pithdoi:10.1007/0-387-27605-x
- [41] Little, R. J. A. and Rubin, D. B. (2019). Statistical Analysis with Missing Data, 3rd ed. John Wiley & Sons, Hoboken, NJ. doi:10.1002/9781119482260 on Pithdoi:10.1002/9781119482260
- [42] Lourenço, H. R., Martin, O. C., and Stützle, T. (2003). Iterated local search. In F. Glover and G. A. Kochenberger (eds.), Handbook of Metaheuristics, pp. 320--353. Kluwer Academic Publishers, Boston. doi:10.1007/0-306-48056-5\_11 on Pithdoi:10.1007/0-306-48056-5
- [43] Patefield, W. M. (1981). Algorithm AS 159: An efficient method of generating random r c tables with given row and column totals. Journal of the Royal Statistical Society, Series C (Applied Statistics) 30(1), 91--97. doi:10.2307/2346669 on Pithdoi:10.2307/2346669
- [44] Rubin, D. B. (1987). Multiple Imputation for Nonresponse in Surveys. John Wiley & Sons, New York. doi:10.1002/9780470316696 on Pithdoi:10.1002/9780470316696
- [45] Schwarz, G. (1978). Estimating the dimension of a model. The Annals of Statistics 6(2), 461--464. doi:10.1214/aos/1176344136 on Pithdoi:10.1214/aos/1176344136
- [46] Szabo, A. and Boucher, K. (2002). Estimating an oncogenetic tree when false negatives and positives are present. Mathematical Biosciences 176(2), 219--236. doi:10.1016/S0025-5564(02)00086-X on Pithdoi:10.1016/s0025-5564(02)00086-x
- [47] Tur, I. and Castelo, R. (2011). Learning mixed graphical models from data with p larger than n . In Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI 2011), pp. 689--697. AUAI Press, Corvallis, OR. arXiv:1202.3765 on PithPith's reviewarXiv
- [48] Tur, I., Roverato, A. and Castelo, R. (2014). Mapping eQTL networks with mixed graphical Markov models. Genetics 198(4), 1377--1393. doi:10.1534/genetics.114.169573 on Pithdoi:10.1534/genetics.114.169573
- [49] U.S. Department of Commerce, Bureau of the Census (1977). Statistical Abstract of the United States, and County and City Data Book. Washington, DC. Distributed with R as state.x77 in the package datasets on Pith
- [50] Weinstein, J. N., Collisson, E. A., Mills, G. B., Shaw, K. R. M., Ozenberger, B. A., Ellrott, K., Shmulevich, I., Sander, C., Stuart, J. M. and The Cancer Genome Atlas Research Network (2013). The Cancer Genome Atlas Pan-Cancer analysis project. Nature Genetics, 45(10), 1113--... on Pithdoi:10.1038/ng.2764
- [51] Whittaker, J. (1990). Graphical Models in Applied Multivariate Statistics. John Wiley & Sons, Chichester on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment