The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
Open accessAbstract
The problem of graphical model selection is to estimate the graph structure of a Markov random field given samples from it. We analyze the information-theoretic limitations of the problem of graph selection for binary Markov random fields under high-dimensional scaling, in which the graph size and the number of edges k, and/or the maximal node degree d, are allowed to increase to infinity as a function of the sample size n. For pair-wise binary Markov random fields, we derive both necessary and sufficient conditions for correct graph selection over the class Gp,kof graphs on vertices with at most k edges, and over the class Gp,dof graphs on p vertices with maximum degree at most d. For the class Gp,k, we establish the existence of constants c and c' such that if n; c' k2log p. Similarly, for the class Gp,d, we exhibit constants c and c' such that for n2log p, any method fails with probability at least 1/2, and we demonstrate a graph decoder that succeeds with high probability for n >; c' d3log p.
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
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Causation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (2001) · doi:10.7551/mitpress/1754.001.0001 · Cited by 4,521
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
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
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
Learning Bayesian networks is NP-complete
Chickering, D. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2404-4_12 · Cited by 1,001
Cited by
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Self-citationInverse statistical problems: from the inverse Ising problem to data science
Nguyen, H. C., Zecchina, R., & Berg, J. (2017) · Advances in Physics · doi:10.1080/00018732.2017.1341604 · Cited by 258
Jiang, J., Chen, S., Tsou, T., McGinnis, C. S., Khazaei, T., Zhu, Q., Park, J. H., Strazhnik, I.-M., Vielmetter, J., Gong, Y., et al. (2023) · doi:10.1101/2023.04.19.537364 · Cited by 21
Metadata
- Authors
- Santhanam, N. P., & Wainwright, M. J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2012-07
- Volume
- 58
- Issue
- 7
- Pages
- 4117-4134
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2108829665
- Cited by
- 193
- References
- 7
- FWCI
- 9.89
- Type
- journal article
- Language
- en
- Open access
- green
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.