Chains with infinite connections: Uniqueness and Markov representation

DOI10.1007/BF00319986zbMATH Open0611.60059WikidataQ98382948 ScholiaQ98382948MaRDI QIDQ1087237FDOQ1087237

Publication date: 1987

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Recommendations

A completely stationary Markov chain with infinite state space
Chains with complete connections: general theory, uniqueness, loss of memory and mixing properties
Constructive Markov chains indexed by $\mathbb Z$
On some bidimensional denumerable chains of infinite order
Continuity properties of a factor of Markov chains

zbMATH Keywords

continuity condition chains with infinite connections uniqueness of distributions of stationary chains

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sample path properties (60G17)

Cites Work

Equilibrium states and the ergodic theory of Anosov diffeomorphisms
Strongly mixing g-measures
Principe variationnel et syst�mes dynamiques symboliques
Regenerative representation for one-dimensional Gibbs states
Ising model and Bernoulli schemes in one dimension
Examples for the Nonuniqueness of the Equilibrium State
On chains of infinite order
Title not available (Why is that?)
On the strong law of large numbers for a class of stochastic processes
Finitely determined processes - An indiscrete approach
Title not available (Why is that?)
A limitation of Markov representation for stationary processes

Cited In (40)

Every ``lower psi-mixing Markov chain is ``interlaced rho-mixing
Title not available (Why is that?)
Uniqueness vs. non-uniqueness for complete connections with modified majority rules
A limitation of Markov representation for stationary processes
Finitarily deterministic generators for zero entropy systems
Infinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural nets
Uniqueness of the measure with full dimension on sofic affine-invariant subsets of the 2-torus
Perfect simulation of processes with long memory: a ``coupling into and from the past algorithm
On some bidimensional denumerable chains of infinite order
On distributionally regenerative Markov chains
Unique Bernoulli $g$-measures
Nonuniqueness in $g$-functions
Limit theorems for discrete Hawkes processes
Infinite partitions and Rokhlin towers
Title not available (Why is that?)
Observing a Preferred Distribution
Non-uniqueness for specifications in $\ell^{2+\epsilon}$
A note on a theorem of Karlin
Stationary Markov chains with linear regressions.
Divergent perpetuities modulated by regime switches
Weakly dependent chains with infinite memory
One-dimensional infinite memory imitation models with noise
Regeneration for chains with infinite memory
Correlations and transport in exclusion processes with general finite memory
Renewal representations for Markov operators
Chains with complete connections: general theory, uniqueness, loss of memory and mixing properties
Uniqueness and ergodic properties of attractive g-measures
Automating Leibniz's theory of concepts
Nonlinear Poisson autoregression and nonlinear Hawkes processes
Dynamic uniqueness for stochastic chains with unbounded memory
Continuity properties of a factor of Markov chains
Divergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processes
Entropic repulsion and lack of the $g$-measure property for Dyson models
Random Markov processes for countable and uncountable alphabets
Perfect simulation of a coupling achieving the $\bar{d}$-distance between ordered pairs of binary chains of infinite order
Criteria for $\bar {d}$-continuity
Random Markov processes and uniform martingales
Random linear recursions with dependent coefficients
Phase transitions in long-range Ising models and an optimal condition for factors of -measures
Chains with unbounded variable length memory: perfect simulation and a visible regeneration scheme

This page was built for publication: Chains with infinite connections: Uniqueness and Markov representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087237)