getdoc3d2c. 241KB Jun 04 2011 12:04:17 AM
Teks penuh
Gambar
Garis besar
Dokumen terkait
In this note, we consider partitions of n with parts related to k -gonal numbers for some fixed integer k ≥ 3.. Various works have appeared involving partitions into
We prove the CLT for a random walk in a dynamical environment where the states of the environ- ment at different sites are independent Markov chains..
Central limit theorems for Markov chains are considered, and in particular the relationships between various expressions for asymptotic variance known from the literature.. These
The most successful techniques in the quantitative study of (time homogeneous) finite Markov chains include: coupling, strong stationary time, spectral methods, and
Recently Diaconis and Miclo [ 5 ] have given another formulation using iterated random function Markov chains that allows them to deduce more information about the limiting shape
A question of increasing importance in the Markov chain Monte Carlo literature (Gelfand and Smith, 1990; Smith and Roberts, 1993) is the issue of geometric ergodicity of Markov
Central limit theorems for functionals of general state space Markov chains are of crucial importance in sensible implementation of Markov chain Monte Carlo algorithms as well as
For a given ordinary differential equation we propose a method consisting in a sequence of Markov chains to approximate its solution, where each of these chains minus its
