kees-study/cds-monte-carlo-methods
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

04: Simplify the calculation of P(x -> x) in 1d

Browse Source
This commit is contained in:
Kees van Kempen
2022-10-03 15:15:52 +02:00
parent c82d021759
commit cc3a7b6b2a
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
Exercise sheet 4/exercise_sheet_04.ipynb
View File

@ -510,10 +510,10 @@
" \n", " \n",
" for x in range(n):\n", " for x in range(n):\n",
" for y in range(n):\n", " for y in range(n):\n",
" if x == y:\n", " if x != y:\n",
" P[y, x] = 1 - np.sum([Q[x, z]*acceptance_probability(graph, x, z) if z != x else 0 for z in range(n)])\n",
" else:\n",
" P[y, x] = Q[x, y]*acceptance_probability(graph, x, y)\n", " P[y, x] = Q[x, y]*acceptance_probability(graph, x, y)\n",
" # Finally, we have to calculate P(x -> x):\n",
" P[x, x] = 1 - np.sum(P[:, x])\n",
" return P\n", " return P\n",
"\n", "\n",
"# plotting\n", "# plotting\n",