2.-Statistics/MCMC.md

@@ -29,7 +29,7 @@ There are several algorithms within the MCMC family, each suited to different ty
 The **Metropolis-Hastings (MH)** algorithm is one of the foundational MCMC methods. It generates a candidate point and determines whether to accept it based on an acceptance probability, which compares the likelihood of the current and proposed points.
 
 1. Start with an initial state $\mathbf{x}_0$.
-2. Propose a new candidate $\mathbf{x}^*$ based on a proposal distribution $q(\mathbf{x}^*|\mathbf{x}_t)$.
+2. Propose a new candidate $\mathbf{x}^{\*}$ based on a proposal distribution $q(\mathbf{x}^{\*}|\mathbf{x}_t)$.
 3. Calculate the acceptance probability:
 
 $$