%PDF-1.4 5 0 obj << /S /GoTo /D (section.1) >> endobj 8 0 obj (Introduction) endobj 9 0 obj << /S /GoTo /D (subsection.1.1) >> endobj 12 0 obj (Definitions and notation) endobj 13 0 obj << /S /GoTo /D (subsection.1.2) >> endobj 16 0 obj (Geometric ergodicity) endobj 17 0 obj << /S /GoTo /D (subsection.1.3) >> endobj 20 0 obj (Polynomial ergodicity) endobj 21 0 obj << /S /GoTo /D (section.2) >> endobj 24 0 obj (Geometric ergodicity implies domCFTP) endobj 25 0 obj << /S /GoTo /D (section.3) >> endobj 28 0 obj (domCFTP for suitable positive recurrent chains) endobj 29 0 obj << /S /GoTo /D (subsection.3.1) >> endobj 32 0 obj (Adaptive subsampling) endobj 33 0 obj << /S /GoTo /D (subsection.3.2) >> endobj 36 0 obj (Tame and wild chains) endobj 37 0 obj << /S /GoTo /D (subsection.3.3) >> endobj 40 0 obj (The domCFTP algorithm for tame chains) endobj 41 0 obj << /S /GoTo /D (subsection.3.4) >> endobj 44 0 obj (When is a chain tame?) endobj 45 0 obj << /S /GoTo /D (section.4) >> endobj 48 0 obj (Examples) endobj 49 0 obj << /S /GoTo /D (subsection.4.1) >> endobj 52 0 obj (Epoch chain) endobj 53 0 obj << /S /GoTo /D (subsection.4.2) >> endobj 56 0 obj (Delayed death process) endobj 57 0 obj << /S /GoTo /D (subsection.4.3) >> endobj 60 0 obj (Delayed simple random walk) endobj 61 0 obj << /S /GoTo /D (subsection.4.4) >> endobj 64 0 obj (Random walk Metropolis-Hastings) endobj 65 0 obj << /S /GoTo /D (subsection.4.5) >> endobj 68 0 obj (Random walk on a half-line) endobj 69 0 obj << /S /GoTo /D (section.5) >> endobj 72 0 obj (Conclusions and questions) endobj 73 0 obj << /S /GoTo /D (section*.1) >> endobj 76 0 obj (References) endobj 77 0 obj << /S /GoTo /D [78 0 R /Fit ] >> endobj 80 0 obj << /Length 675 /Filter /FlateDecode >> stream xڕT]O0}c"-~`Ɇm[j)TByҵ)}kv-bhAssA`Cmؔ}@ 94Bz&~ Ń0`-ΰl6dۄ0KZ0$@(u e<},w^p!@nă12<7`֬|˞BIiCfS]6٪&4q3˅ cF\,[$R=ea l&L^2Pɗ