Neighborhood radius estimation for variable-neighborhood random fields
From MaRDI portal
Abstract: We consider random fields defined by finite-region conditional probabilities depending on a neighborhood of the region which changes with the boundary conditions. To predict the symbols within any finite region it is necessary to inspect a random number of neighborhood symbols which might change according to the value of them. In analogy to the one dimensional setting we call these neighborhood symbols the context of the region. This framework is a natural extension, to d-dimensional fields, of the notion of variable-length Markov chains introduced by Rissanen (1983) in his classical paper. We define an algorithm to estimate the radius of the smallest ball containing the context based on a realization of the field. We prove the consistency of this estimator. Our proofs are constructive and yield explicit upper bounds for the probability of wrong estimation of the radius of the context.
Recommendations
- Estimate of the interaction neighborhood radius for a Markov random field
- Consistent estimation of the basic neighborhood of Markov random fields
- Partially observed Markov random fields are variable neighborhood random fields
- Exponential inequalities for VLMC empirical trees
- An oracle approach for interaction neighborhood estimation in random fields
Cites work
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- A consistent model selection procedure for Markov random fields based on penalized pseudolikelihood
- A universal data compression system
- Consistent estimation of the basic neighborhood of Markov random fields
- Context tree estimation for not necessarily finite memory processes, via BIC and MDL
- Estimation of General Stationary Processes by Variable Length Markov Chains
- Existence of Gibbsian point processes with geometry-dependent interactions
- Exponential inequalities and functional central limit theorems for random fields
- Exponential inequalities for VLMC empirical trees
- Exponential inequalities for empirical unbounded context trees
- Gibbs measures and phase transitions
- Gibbsian random fields for lattice systems with pairwise interactions.
- Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets
- On Bernstein-type inequalities for martingales.
- On consistency of a class of estimators for exponential families of Markov random fields on the lattice
- On the estimation of the order of a Markov chain and universal data compression
- Practical simulation and estimation for Gibbs Delaunay-Voronoi tessellations with geometric hardcore interaction
- Refinements of Pinsker's inequality
- Scaling limits in statistical mechanics and microstructures in continuum mechanics
- The optimal error exponent for Markov order estimation
- The problem of uniqueness of a Gibbsian random field and the problem of phase transitions
Cited in
(10)- Asymptotic normality of the maximum likelihood estimator for cooperative sequential adsorp\-tion
- Identifying interacting pairs of sites in Ising models on a countable set
- On universal algorithms for classifying and predicting stationary processes
- Data-driven neighborhood selection of a Gaussian field
- Estimate of the interaction neighborhood radius for a Markov random field
- Structure recovery for partially observed discrete Markov random fields on graphs under not necessarily positive distributions
- Model selection for Markov random fields on graphs under a mixing condition
- Almost Gibbsianness and parsimonious description of the decimated 2d-Ising model
- Partially observed Markov random fields are variable neighborhood random fields
- Estimating the interaction graph of stochastic neural dynamics
This page was built for publication: Neighborhood radius estimation for variable-neighborhood random fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q554466)
