%PDF-1.4 % 5 0 obj << /S /GoTo /D (section.1) >> endobj 8 0 obj (Problem: Markov chains \(10 points\)) endobj 9 0 obj << /S /GoTo /D (subsection.1.1) >> endobj 12 0 obj (Definition) endobj 13 0 obj << /S /GoTo /D (subsection.1.2) >> endobj 16 0 obj (Matrix of transition probabilities and stationary solutions) endobj 17 0 obj << /S /GoTo /D (subsection.1.3) >> endobj 20 0 obj (Example: Cumulative maximum) endobj 21 0 obj << /S /GoTo /D (section.2) >> endobj 24 0 obj (Metropolis-Hastings algorithm \(no points\)) endobj 25 0 obj << /S /GoTo /D (subsection.2.1) >> endobj 28 0 obj (Motivation: Calculating weighted averages by sampling) endobj 29 0 obj << /S /GoTo /D (subsection.2.2) >> endobj 32 0 obj (Markov chain for Metropolis-Hastings algorithm) endobj 33 0 obj << /S /GoTo /D [34 0 R /Fit ] >> endobj 37 0 obj << /Length 2304 /Filter /FlateDecode >> stream xڽYmB&O$ECP$AdMR@kkȒ#iwo;á<\DQ
һ#5