High-dimensional structure estimation in Ising models: local separation criterion

DOI10.1214/12-AOS1009zbMath1297.62124arXiv1107.1736MaRDI QIDQ693728

Vincent Y. F. Tan, Animashree Anandkumar, Alan S. Willsky, Furong Huang

Publication date: 10 December 2012

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.1736

zbMATH Keywords

Ising modelsgraphical model selectionlocal-separation property

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Universality of the mean-field for the Potts model, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Learning loopy graphical models with latent variables: efficient methods and guarantees, Computational implications of reducing data to sufficient statistics, Causal Structural Learning via Local Graphs, Learning a tree-structured Ising model in order to make predictions, Joint estimation of parameters in Ising model, Structure estimation for discrete graphical models: generalized covariance matrices and their inverses, AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms, Sparse model selection in the highly under-sampled regime, A decomposition-based algorithm for learning the structure of multivariate regression chain graphs, Bayesian model selection for high-dimensional Ising models, with applications to educational data, A global approach for learning sparse Ising models, Empirical comparison study of approximate methods for structure selection in binary graphical models, High-dimensional structure estimation in Ising models: local separation criterion, Updating of the Gaussian graphical model through targeted penalized estimation, Estimating heterogeneous graphical models for discrete data with an application to roll call voting, Inequalities on partial correlations in Gaussian graphical models containing star shapes, Property testing in high-dimensional Ising models, High-dimensional Ising model selection with Bayesian information criteria

Uses Software

• pcalg

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ising models on power-law random graphs
• High-dimensional structure estimation in Ising models: local separation criterion
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Mengerian theorems for paths of bounded length
• Diameter and treewidth in minor-closed graph families
• Learning Bayesian networks from data: An information-theory based approach
• Short cycles in random regular graphs
• Rejoinder: Latent variable graphical model selection via convex optimization
• High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
• High-dimensional graphs and variable selection with the Lasso
• On the girth of random Cayley graphs
• Statistical mechanics of complex networks
• The Complexity of Distinguishing Markov Random Fields
• Graphical Models, Exponential Families, and Variational Inference
• Biological Sequence Analysis
• Markov Chains
• Random graph models of social networks
• Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures
• A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures
• Collective dynamics of ‘small-world’ networks
• Learning Latent Tree Graphical Models
• Elements of Information Theory
• Approximating discrete probability distributions with dependence trees
• Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms