This article demonstrates a method to design computer experiments using Strauss processes, suggesting improved adaptation options.
This article proposes a method for constructing computer experiment designs, specifically for Strauss processes marked by three types of marks. This method is based on the theory of marked point processes. The designs obtained using the Monte Carlo Markov Chain (MCMC) method and the Metropolis–Hastings algorithm are easily adaptable and can meet various objectives. A detailed study on the convergence of the Markov chain was conducted. In addition, a comparison was made between our approach and other existing computer experiment designs.
No takes yet. Share an insight, caveat, or question.
Elmossaoui et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: