deletions | additions       diff --git a/Quasi_random_sampling_Quasi_random__.md b/Quasi_random_sampling_Quasi_random__.md  index 0573a35..80d910b 100644  --- a/Quasi_random_sampling_Quasi_random__.md  +++ b/Quasi_random_sampling_Quasi_random__.md 
...
# Quasi-random sampling  Determinability is a desirable property from a reproducibility perspective because it ensures that, in principle, users with the same version of the software   will always converge to exactly the same solution.  Quasi-random sampling is a technique that attempts to combine the statistical advantages of (pseudo-)random sampling with a fully deterministic algorithm.  (Determinability is a desirable property from a reproducibility perspective because it ensures that, in principle, users with the same version of the software   will always converge to exactly the same solution.)  A quasi-random sequence is a deterministic sequence of "random-like" values that can be generated by an algorithm.  What makes quasi-random sequences superior to pseudo-random numbers for sampling is that one can construct quasi-random sequences which are biased toward "spreading out," i.e., covering more of the domain.  For example, the Halton sequence is a quasi-random sequence of numbers generated over a fixed interval by using a prime number as a base \cite{Halton_1964}.