fix Metropolis-Hastings formula in docs

issp-center-dev · Apr 15, 2021 · ec6146b · ec6146b
1 parent 8a61c0e
commit ec6146b
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/doc/en/source/algorithm/exchange.rst b/doc/en/source/algorithm/exchange.rst
@@ -172,7 +172,7 @@ The acceptance probability :math:`Q(\vec{x} | \vec{x}_t)` is defined as
 
 .. math::
 
-  Q(\vec{x} | \vec{x}_t) = \min\left[1, \frac{W(\vec{x})P(\vec{x}_t | \vec{x}) }{W(\vec{x}_t) P(\vec{x}_t | \vec{x})} \right].
+  Q(\vec{x} | \vec{x}_t) = \min\left[1, \frac{W(\vec{x})P(\vec{x}_t | \vec{x}) }{W(\vec{x}_t) P(\vec{x} | \vec{x}_t)} \right].
 
 It is easy to verify that the detailed balance condition is satisfied by substituting it into the detailed balance condition equation.
 

diff --git a/doc/ja/source/algorithm/exchange.rst b/doc/ja/source/algorithm/exchange.rst
@@ -165,7 +165,7 @@ MH 法では、遷移プロセスを提案プロセスと採択プロセスと
 
 .. math::
 
-  Q(\vec{x} | \vec{x}_t) = \min\left[1, \frac{W(\vec{x})P(\vec{x}_t | \vec{x}) }{W(\vec{x}_t) P(\vec{x}_t | \vec{x})} \right]
+  Q(\vec{x} | \vec{x}_t) = \min\left[1, \frac{W(\vec{x})P(\vec{x}_t | \vec{x}) }{W(\vec{x}_t) P(\vec{x} | \vec{x}_t)} \right]
 
 とします。
 この定義が詳細釣り合い条件を満たすことは、詳細釣り合いの式に代入することで簡単に確かめられます。