New Computer Experiment Designs with Area-Interaction Point Processes

Ahmed Ait Ameur (), Hichem Elmossaoui and Nadia Oukid
Additional contact information
Ahmed Ait Ameur: LAMDA-RO Laboratory, Department of Mathematics, Faculty of Sciences, University Saad Dahlab Blida1, Soumâa BP 270, Blida, Algeria
Hichem Elmossaoui: LAMDA-RO Laboratory, Department of Mathematics, Faculty of Sciences, University Saad Dahlab Blida1, Soumâa BP 270, Blida, Algeria
Nadia Oukid: LAMDA-RO Laboratory, Department of Mathematics, Faculty of Sciences, University Saad Dahlab Blida1, Soumâa BP 270, Blida, Algeria

Mathematics, 2024, vol. 12, issue 15, 1-17

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; Metropolis–Hastings algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/15/2397/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/15/2397/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:15:p:2397-:d:1447353

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().