Model selection for Markov random fields on graphs under a mixing condition
From MaRDI portal
Publication:6657407
DOI10.1016/j.spa.2024.104523MaRDI QIDQ6657407
Magno T. F. Severino, Florencia Leonardi
Publication date: 6 January 2025
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Random fields (60G60) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Estimation of high-dimensional partially-observed discrete Markov random fields
- Gibbs measures and phase transitions.
- Neighborhood radius estimation for variable-neighborhood random fields
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Parameter estimation for Gibbs distributions from partially observed data
- On consistency of a class of estimators for exponential families of Markov random fields on the lattice
- Estimating the dimension of a model
- Estimating the interaction graph of stochastic neural dynamics
- A consistent model selection procedure for Markov random fields based on penalized pseudolikelihood
- High-dimensional semiparametric Gaussian copula graphical models
- Identifying interacting pairs of sites in Ising models on a countable set
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Consistent estimation of the basic neighborhood of Markov random fields
- High-dimensional graphs and variable selection with the Lasso
- Penalized Pseudolikelihood Inference in Spatial Interaction Models with Covariates
- On Graphical Models via Univariate Exponential Family Distributions
- Markov Random Fields with Higher-order Interactions
- Large-scale typicality of Markov sample paths and consistency of MDL order estimators
- 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
- The law of the iterated logarithm for stationary processes satisfying mixing conditions
- Structure Learning of Contextual Markov Networks using Marginal Pseudo‐likelihood
- Sharp oracle inequalities and slope heuristic for specification probabilities estimation in discrete random fields
- Sparse nonparametric graphical models
- Structure recovery for partially observed discrete Markov random fields on graphs under not necessarily positive distributions
This page was built for publication: Model selection for Markov random fields on graphs under a mixing condition