| Format | |
|---|---|
| BibTeX | |
| MARCXML | |
| TextMARC | |
| MARC | |
| DublinCore | |
| EndNote | |
| NLM | |
| RefWorks | |
| RIS |
Linked e-resources
Details
Table of Contents
2.1.3 Additive Functionals
2.2 Uniform Ellipticity
2.2.1 The Definition
2.2.2 Contraction Estimates and Exponential Mixing
2.2.3 Bridge Probabilities
2.3 Structure Constants
2.3.1 Hexagons
2.3.2 Balance and Structure Constants
2.3.3 The Ladder Process
2.4 y-Step Ellipticity Conditions
*2.5 Uniform Ellipticity and Strong Mixing Conditions
2.6 Reduction to Point Mass Initial Distributions
2.7 Notes and References
3 Variance Growth, Center-Tightness, and the CentralLimit Theorem
3.1 Main Results
3.1.1 Center-Tightness and Variance Growth
Intro
Acknowledgments
Contents
Notation
1 Overview
1.1 Setup and Aim
1.2 The Obstructions to the Local Limit Theorems
1.3 How to Show that the Obstructions Do Not Occur
1.4 What Happens When the Obstructions Do Occur
1.4.1 Lattice Case
1.4.2 Center-Tight Case
1.4.3 Reducible Case
1.5 Some Final Words on the Setup of this Work
1.6 Prerequisites
1.7 Notes and References
2 Markov Arrays, Additive Functionals, and Uniform Ellipticity
2.1 The Basic Setup
2.1.1 Inhomogeneous Markov Chains
2.1.2 Inhomogeneous Markov Arrays
3.1.2 The Central Limit Theorem and theTwo-Series Theorem
3.2 Proofs
3.2.1 The Gradient Lemma
3.2.2 The Estimate of Var(SN)
3.2.3 McLeish's Martingale Central Limit Theorem
3.2.4 Proof of the Central Limit Theorem
3.2.5 Convergence of Moments
3.2.6 Characterization of Center-Tight Additive Functionals
3.2.7 Proof of the Two-Series Theorem
*3.3 The Almost Sure Invariance Principle
3.4 Notes and References
4 The Essential Range and Irreducibility
4.1 Definitions and Motivation
4.2 Main Results
4.2.1 Markov Chains
4.2.2 Markov Arrays
4.2.3 Hereditary Arrays
4.3 Proofs
4.3.1 Reduction Lemma
4.3.2 Joint Reduction
4.3.3 The Possible Values of the Co-Range
4.3.4 Calculation of the Essential Range
4.3.5 Existence of Irreducible Reductions
4.3.6 Characterization of Hereditary Additive Functionals
4.4 Notes and References
5 The Local Limit Theorem in the Irreducible Case
5.1 Main Results
5.1.1 Local Limit Theorems for Markov Chains
5.1.2 Local Limit Theorems for Markov Arrays
5.1.3 Mixing Local Limit Theorems
5.2 Proofs
5.2.1 Strategy of Proof
5.2.2 Characteristic Function Estimates
5.2.3 The LLT via Weak Convergence of Measures
5.2.4 The LLT in the Irreducible Non-Lattice Case
5.2.5 The LLT in the Irreducible Lattice Case
5.2.6 Mixing LLT
5.3 Notes and References
6 The Local Limit Theorem in the Reducible Case
6.1 Main Results
6.1.1 Heuristics and Warm Up Examples
6.1.2 The LLT in the Reducible Case
6.1.3 Irreducibility as a Necessary Condition for the Mixing LLT
6.1.4 Universal Bounds for Prob[SN-zN(a,b)]
6.2 Proofs
6.2.1 Characteristic Functions in the Reducible Case
6.2.2 Proof of the LLT in the Reducible Case
2.2 Uniform Ellipticity
2.2.1 The Definition
2.2.2 Contraction Estimates and Exponential Mixing
2.2.3 Bridge Probabilities
2.3 Structure Constants
2.3.1 Hexagons
2.3.2 Balance and Structure Constants
2.3.3 The Ladder Process
2.4 y-Step Ellipticity Conditions
*2.5 Uniform Ellipticity and Strong Mixing Conditions
2.6 Reduction to Point Mass Initial Distributions
2.7 Notes and References
3 Variance Growth, Center-Tightness, and the CentralLimit Theorem
3.1 Main Results
3.1.1 Center-Tightness and Variance Growth
Intro
Acknowledgments
Contents
Notation
1 Overview
1.1 Setup and Aim
1.2 The Obstructions to the Local Limit Theorems
1.3 How to Show that the Obstructions Do Not Occur
1.4 What Happens When the Obstructions Do Occur
1.4.1 Lattice Case
1.4.2 Center-Tight Case
1.4.3 Reducible Case
1.5 Some Final Words on the Setup of this Work
1.6 Prerequisites
1.7 Notes and References
2 Markov Arrays, Additive Functionals, and Uniform Ellipticity
2.1 The Basic Setup
2.1.1 Inhomogeneous Markov Chains
2.1.2 Inhomogeneous Markov Arrays
3.1.2 The Central Limit Theorem and theTwo-Series Theorem
3.2 Proofs
3.2.1 The Gradient Lemma
3.2.2 The Estimate of Var(SN)
3.2.3 McLeish's Martingale Central Limit Theorem
3.2.4 Proof of the Central Limit Theorem
3.2.5 Convergence of Moments
3.2.6 Characterization of Center-Tight Additive Functionals
3.2.7 Proof of the Two-Series Theorem
*3.3 The Almost Sure Invariance Principle
3.4 Notes and References
4 The Essential Range and Irreducibility
4.1 Definitions and Motivation
4.2 Main Results
4.2.1 Markov Chains
4.2.2 Markov Arrays
4.2.3 Hereditary Arrays
4.3 Proofs
4.3.1 Reduction Lemma
4.3.2 Joint Reduction
4.3.3 The Possible Values of the Co-Range
4.3.4 Calculation of the Essential Range
4.3.5 Existence of Irreducible Reductions
4.3.6 Characterization of Hereditary Additive Functionals
4.4 Notes and References
5 The Local Limit Theorem in the Irreducible Case
5.1 Main Results
5.1.1 Local Limit Theorems for Markov Chains
5.1.2 Local Limit Theorems for Markov Arrays
5.1.3 Mixing Local Limit Theorems
5.2 Proofs
5.2.1 Strategy of Proof
5.2.2 Characteristic Function Estimates
5.2.3 The LLT via Weak Convergence of Measures
5.2.4 The LLT in the Irreducible Non-Lattice Case
5.2.5 The LLT in the Irreducible Lattice Case
5.2.6 Mixing LLT
5.3 Notes and References
6 The Local Limit Theorem in the Reducible Case
6.1 Main Results
6.1.1 Heuristics and Warm Up Examples
6.1.2 The LLT in the Reducible Case
6.1.3 Irreducibility as a Necessary Condition for the Mixing LLT
6.1.4 Universal Bounds for Prob[SN-zN(a,b)]
6.2 Proofs
6.2.1 Characteristic Functions in the Reducible Case
6.2.2 Proof of the LLT in the Reducible Case