Kalikow-type decomposition for multicolor infinite range particle systems
From MaRDI portal
(Redirected from Publication:363863)
Abstract: We consider a particle system on with real state space and interactions of infinite range. Assuming that the rate of change is continuous we obtain a Kalikow-type decomposition of the infinite range change rates as a mixture of finite range change rates. Furthermore, if a high noise condition holds, as an application of this decomposition, we design a feasible perfect simulation algorithm to sample from the stationary process. Finally, the perfect simulation scheme allows us to forge an algorithm to obtain an explicit construction of a coupling attaining Ornstein's -distance for two ordered Ising probability measures.
Recommendations
- Perfect simulation of infinite range Gibbs measures and coupling with their finite range approximations
- A coupling of infinite particle systems
- A coupling of infinite particle systems. II
- Perfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite order
- A coupling construction for spin systems with infinite range interactions
Cites work
- scientific article; zbMATH DE number 991497 (Why is no real title available?)
- scientific article; zbMATH DE number 5017183 (Why is no real title available?)
- scientific article; zbMATH DE number 4058704 (Why is no real title available?)
- scientific article; zbMATH DE number 4078467 (Why is no real title available?)
- scientific article; zbMATH DE number 1188967 (Why is no real title available?)
- scientific article; zbMATH DE number 1208108 (Why is no real title available?)
- scientific article; zbMATH DE number 1023434 (Why is no real title available?)
- scientific article; zbMATH DE number 1912119 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- A uniqueness condition for Gibbs measures, with application to the 2- dimensional Ising antiferromagnet
- An interruptible algorithm for perfect sampling via Markov chains
- Cesàro mean distribution of group automata starting from measures with summable decay
- Cluster expansion for abstract polymer models
- Convergence in the Wasserstein Metric for Markov Chain Monte Carlo Algorithms with Applications to Image Restoration
- Disagreement percolation in the study of Markov fields
- Ergodicity for spin systems with stirrings
- Ergodicity of probabilistic cellular automata: A constructive criterion
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Existence and perfect simulation of one-dimensional loss networks
- How Gibbs distributions may naturally arise from synaptic adaptation mechanisms. A model-based argumentation
- No phase transition for Gaussian fields with bounded spins
- Nonuniqueness in \(g\)-functions
- Notes on perfect simulation
- On consistency of a class of estimators for exponential families of Markov random fields on the lattice
- On the existence and nonexistence of finitary codings for a class of random fields
- Parameter estimation for Gibbs distributions from partially observed data
- Perfect Simulation for Image Restoration
- Perfect simulation for a class of positive recurrent Markov chains
- Perfect simulation for interacting point processes, loss networks and Ising models.
- Perfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite order
- Perfect simulation of infinite range Gibbs measures and coupling with their finite range approximations
- Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
- Perfectly random sampling of truncated multinormal distributions
- Processes with long memory: Regenerative construction and perfect simulation
- Random Markov processes and uniform martingales
- Spatial statistics and modeling. Translated from the French by Kevin Bleakley.
- Statistical-mechanical approach to image processing
- Une classe de syst�mes de particules stable par association
Cited in
(6)- Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets
- Kalikow decomposition for counting processes with stochastic intensity and application to simulation algorithms
- A stochastic system with infinite interacting components to model the time evolution of the membrane potentials of a population of neurons
- Sparse space-time models: concentration inequalities and Lasso
- Boolean percolation on doubling graphs
- An interacting neuronal network with inhibition: theoretical analysis and perfect simulation
This page was built for publication: Kalikow-type decomposition for multicolor infinite range particle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q363863)
