High-dimensional Ising model selection with Bayesian information criteria
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We consider the use of Bayesian information criteria for selection of the graph underlying an Ising model. In an Ising model, the full conditional distributions of each variable form logistic regression models, and variable selection techniques for regression allow one to identify the neighborhood of each node and, thus, the entire graph. We prove high-dimensional consistency results for this pseudo-likelihood approach to graph selection when using Bayesian information criteria for the variable selection problems in the logistic regressions. The results pertain to scenarios of sparsity, and following related prior work the information criteria we consider incorporate an explicit prior that encourages sparsity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521 · cited 3×
“…penalization ρ to produce the candidate models: To account for potential asymmetries when we compile information across nodes, we follow the work of Meinshausen and B¨uhlmann (2006) and draw an edge connecting nodes v and w based on either an and rule (requiring both ˆ β vw (cid:54) = 0 and ˆ β wv…”
Method
Cited by
A tutorial on regularized partial correlation networks
Epskamp, S., & Fried, E. I. (2018) · Psychological Methods · doi:10.1037/met0000167 · Cited by 2,918
Comparing network structures on three aspects: A permutation test.
van Borkulo, C. D., van Bork, R., Boschloo, L., Kossakowski, J. J., Tio, P., Schoevers, R. A., Borsboom, D., & Waldorp, L. J. (2023) · Psychological Methods · doi:10.1037/met0000476 · Cited by 1,465
Network analysis of multivariate data in psychological science
Borsboom, D., Deserno, M. K., Rhemtulla, M., Epskamp, S., Fried, E. I., McNally, R. J., Robinaugh, D. J., Perugini, M., Dalege, J., Costantini, G., et al. (2021) · Nature Reviews Methods Primers · doi:10.1038/s43586-021-00055-w · Cited by 1,371
Network analysis: a brief overview and tutorial
Hevey, D. (2018) · Health Psychology and Behavioral Medicine · doi:10.1080/21642850.2018.1521283 · Cited by 1,058
A new method for constructing networks from binary data
van Borkulo, C. D., Borsboom, D., Epskamp, S., Blanken, T. F., Boschloo, L., Schoevers, R. A., & Waldorp, L. J. (2014) · Scientific Reports · doi:10.1038/srep05918 · Cited by 757
mgm: Estimating Time-Varying Mixed Graphical Models in High-Dimensional Data
Haslbeck, J. M. B., & Waldorp, L. J. (2020) · Journal of Statistical Software · doi:10.18637/jss.v093.i08 · Cited by 746
Estimating psychopathological networks: Be careful what you wish for
Epskamp, S., Kruis, J., & Marsman, M. (2017) · PLOS ONE · doi:10.1371/journal.pone.0179891 · Cited by 315
The Network Structure of Symptoms of the Diagnostic and Statistical Manual of Mental Disorders
Boschloo, L., van Borkulo, C. D., Rhemtulla, M., Keyes, K. M., Borsboom, D., & Schoevers, R. A. (2015) · PLOS ONE · doi:10.1371/journal.pone.0137621 · Cited by 285
Estimating psychological networks and their accuracy: A tutorial paper
Epskamp, S., Borsboom, D., & Fried, E. I. (2018) · Behavior Research Methods · doi:10.3758/s13428-017-0862-1 · Cited by 5,715
Foundations of idiographic methods in psychology and applications for psychotherapy
Piccirillo, M. L., & Rodebaugh, T. L. (2019) · Clinical Psychology Review · doi:10.1016/j.cpr.2019.01.002 · Cited by 160
The network structure of paranoia in the general population
Bell, V., & O’Driscoll, C. (2018) · Social Psychiatry and Psychiatric Epidemiology · doi:10.1007/s00127-018-1487-0 · Cited by 83
Caught in a web of trauma: Network analysis of childhood adversity and adult mental ill-health
Breuer, F., Greggersen, W., Kahl, K. G., Schweiger, U., & Westermair, A. L. (2020) · Child Abuse & Neglect · doi:10.1016/j.chiabu.2020.104534 · Cited by 47
Metadata
- Authors
- Barber, R. F., & Drton, M.
- Venue
- Electronic Journal of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2015-01-01
- Volume
- 9
- Issue
- 1
- Pages
- 567-607
- ISSN
- 1935-7524 (ISSN-L)
- OpenAlex
- W2062262717
- Cited by
- 133
- References
- 1
- FWCI
- 10.51
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.