Structure recovery for partially observed discrete Markov random fields on graphs under not necessarily positive distributions
From MaRDI portal
Publication:6196794
Abstract: We propose a penalized pseudo-likelihood criterion to estimate the graph of conditional dependencies in a discrete Markov random field that can be partially observed. We prove the convergence of the estimator in the case of a finite or countable infinite set of nodes. In the finite case, the underlying graph can be recovered with probability one, while in the countable infinite case, we can recover any finite sub-graph with probability one by allowing the candidate neighborhoods to grow as a function o(log n), with n the sample size. Our method requires minimal assumptions on the probability distribution, and contrary to other approaches in the literature, the usual positivity condition is not needed. We evaluate the performance of the estimator on simulated data, and we apply the methodology to a real dataset of stock index markets in different countries.
Cites work
- A consistent model selection procedure for Markov random fields based on penalized pseudolikelihood
- Consistent estimation of the basic neighborhood of Markov random fields
- Context tree selection: a unifying view
- Estimating the dimension of a model
- Estimating the interaction graph of stochastic neural dynamics
- Estimation of high-dimensional partially-observed discrete Markov random fields
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- Gibbs measures and phase transitions.
- Graphical models via univariate exponential family distributions
- High-dimensional graphs and variable selection with the Lasso
- High-dimensional semiparametric Gaussian copula graphical models
- Identifying interacting pairs of sites in Ising models on a countable set
- Independent block identification in multivariate time series
- Information-Theoretic Limits of Selecting Binary Graphical Models in High Dimensions
- Learning Graphical Models From the Glauber Dynamics
- Markov Random Fields with Higher-order Interactions
- Neighborhood radius estimation for variable-neighborhood random fields
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Penalized pseudolikelihood inference in spatial interaction models with covariates
- Probabilistic graphical models.
- Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields
- Sparse nonparametric graphical models
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Structure learning of contextual Markov networks using marginal pseudo-likelihood
This page was built for publication: Structure recovery for partially observed discrete Markov random fields on graphs under not necessarily positive distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196794)
