Chains with infinite connections: Uniqueness and Markov representation

From MaRDI portal
Publication:1087237

DOI10.1007/BF00319986zbMath0611.60059WikidataQ98382948 ScholiaQ98382948MaRDI QIDQ1087237

Henry Berbee

Publication date: 1987

Published in: Probability Theory and Related Fields (Search for Journal in Brave)




Related Items (32)

Regeneration for chains with infinite memoryChains with unbounded variable length memory: perfect simulation and a visible regeneration schemeAutomating Leibniz’s Theory of ConceptsInfinite partitions and Rokhlin towersDivergence rates of Markov order estimators and their application to statistical estimation of stationary ergodic processesInfinite systems of interacting chains with memory of variable length -- a stochastic model for biological neural netsUniqueness and ergodic properties of attractive g-measuresPerfect simulation of a coupling achieving the \(\bar{d}\)-distance between ordered pairs of binary chains of infinite orderOne-dimensional infinite memory imitation models with noiseNonlinear Poisson autoregression and nonlinear Hawkes processesRandom linear recursions with dependent coefficientsRandom Markov processes and uniform martingalesEvery ``lower psi-mixing Markov chain is ``interlaced rho-mixingOn distributionally regenerative Markov chainsRenewal representations for Markov operatorsCorrelations and transport in exclusion processes with general finite memoryRandom Markov processes for countable and uncountable alphabetsNon-uniqueness for specifications inWeakly dependent chains with infinite memoryObserving a Preferred DistributionUnique Bernoulli \(g\)-measuresChains with complete connections: general theory, uniqueness, loss of memory and mixing propertiesA note on a theorem of KarlinUniqueness of the measure with full dimension on sofic affine-invariant subsets of the 2-torusEntropic repulsion and lack of the \(g\)-measure property for Dyson modelsFinitarily deterministic generators for zero entropy systemsPerfect simulation of processes with long memory: A “coupling into and from the past” algorithmDivergent Perpetuities Modulated by Regime SwitchesCriteria for $\bar {d}$-continuityNonuniqueness in \(g\)-functionsLimit theorems for discrete Hawkes processesPhase transitions in long-range Ising models and an optimal condition for factors of -measures



Cites Work


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