Skip to main content
Log in

Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Strong orthogonal arrays (SOAs) have better space-filling properties than ordinary orthogonal arrays for computer experiments. SOAs of strengths two plus and two star can improve the space-filling properties in low dimensions, and column orthogonality plays a vital role in computer experiments. In this paper, we use matchings of the bipartite graphs and Hall’s theorem to present several constructions of column-orthogonal SOAs of strengths two plus and two star. We also give a new direct construction of SOAs of strength two plus. Our constructions can provide larger numbers of factors of SOAs and column-orthogonal SOAs of strengths two plus and two star than those in the existing literature, having flexible run sizes. The constructions are convenient and flexible, and the resulting designs are good for computer experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Asratian A.S., Denley T.M.J., Haggkvist R.: Bipartite Graphs and Their Applications, pp. 75–81. Cambridge University Press, Cambridge (1998).

    Book  MATH  Google Scholar 

  2. Bao J., Ji L., Pan Y.: Constructions of column-orthogonal strong orthogonal arrays. Sci. Sin. Math. 53, 233–248 (2023) in Chinese.

    Article  Google Scholar 

  3. Bao, J., Ji, L., Xu, J.: Direct constructions of column-orthogonal strong orthogonal arrays. Submitted.

  4. Bingham D., Sitter R.R., Tang B.: Orthogonal and nearly orthogonal designs for computer experiments. Biometrika 96, 51–65 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  5. Fang K., Li R., Sudjianto A.: Design and Modeling for Computer Experiments. Hall/CRC, Boca Raton (2006).

    MATH  Google Scholar 

  6. He Y., Cheng C., Tang B.: Strong orthogonal arrays of strength two plus. Ann. Stat. 46, 457–468 (2018).

    Article  MathSciNet  MATH  Google Scholar 

  7. He Y., Tang B.: Strong orthogonal arrays and associated Latin hypercubes for computer experiments. Biometrika 100, 254–260 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  8. He Y., Tang B.: A characterization of strong orthogonal arrays of strength three. Ann. Stat. 42, 115–128 (2014).

    Article  MathSciNet  MATH  Google Scholar 

  9. Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal Arrays. Springer, New York (1999).

    Book  MATH  Google Scholar 

  10. Li W., Liu M., Yang J.: Construction of column-orthogonal strong orthogonal arrays. Stat. Pap. 63, 515–530 (2022).

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu H., Liu M.: Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays. Stat. Sin. 25, 1713–1734 (2015).

    MathSciNet  MATH  Google Scholar 

  12. Santner T.J., Williams B.J., Notz W.I.: The Design and Analysis of Computer Experiments. Springer, New York (2003).

    Book  MATH  Google Scholar 

  13. Zhou Y., Tang B.: Column-orthogonal strong orthogonal arrays of strength two plus and three minus. Biometrika 106, 997–1004 (2019).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors would like to thank anonymous reviewers for their insightful comments and invaluable advice that greatly improved the paper. The authors also thank Prof. L. Ji for his helpful comments. Without their comments and advice, the paper could not appear in the current form.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jingjun Bao.

Additional information

Communicated by M. Paterson.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bao, J. Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs. Des. Codes Cryptogr. 91, 3741–3755 (2023). https://doi.org/10.1007/s10623-023-01267-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-023-01267-9

Keywords

Mathematics Subject Classification

Navigation