New Computer Experiment Designs with Area-Interaction Point Processes

Abstract

This article presents a novel method for constructing computer experiment designs based on the theory of area-interaction point processes. This method is essential for capturing the interactions between different elements within a modeled system, offering a more flexible and adaptable approach compared with traditional mathematical modeling. Unlike conventional rough models that rely on simplified equations, our method employs the Markov Chain Monte Carlo (MCMC) method and the Metropolis–Hastings algorithm combined with Voronoi tessellations. It uses a new dynamic called homogeneous birth and death dynamics of a set of points to generate the designs. This approach does not require the development of specific mathematical models for each system under study, making it universally applicable while achieving comparable results. Furthermore, we provide an in-depth analysis of the convergence properties of the Markov Chain to ensure the reliability of the generated designs. An expanded literature review situates our work within the context of existing research, highlighting its unique contributions and advancements. A comparison between our approach and other existing computer experiment designs has been performed.

Keywords

• experimental designs
• computer experiment designs
• point processes
• area-interaction point processes
• Voronoi tessellations
• Markov chain Monte Carlo (MCMC) method