Comparative study between two versions of Metropolis-Hasting algorithm for generating computer experiment designs according to a point process
This work presents the study of the impact, to use the standard approach of the Metropolis-Hasting algorithm and its approach with delayed rejection, on generating computer experiment designs according to the point stochastic model of Marked Strauss. Finally, an application using Matlab has been developed to easily compare between the two approaches.