{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:39:20Z","timestamp":1757777960345,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/N509449\/1"],"award-info":[{"award-number":["EP\/N509449\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_n = \\{Z_1, \\ldots , Z_n\\}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>n<\/mml:mi><\/mml:msub><mml:mo>=<\/mml:mo><mml:mrow><mml:mo>{<\/mml:mo><mml:msub><mml:mi>Z<\/mml:mi><mml:mn>1<\/mml:mn><\/mml:msub><mml:mo>,<\/mml:mo><mml:mo>\u2026<\/mml:mo><mml:mo>,<\/mml:mo><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>n<\/mml:mi><\/mml:msub><mml:mo>}<\/mml:mo><\/mml:mrow><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>be a design; that is, a collection of<jats:italic>n<\/jats:italic>points<jats:inline-formula><jats:alternatives><jats:tex-math>$$Z_j \\in [-1,1]^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>j<\/mml:mi><\/mml:msub><mml:mo>\u2208<\/mml:mo><mml:msup><mml:mrow><mml:mo>[<\/mml:mo><mml:mo>-<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>,<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>]<\/mml:mo><\/mml:mrow><mml:mi>d<\/mml:mi><\/mml:msup><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We study the quality of quantisation of<jats:inline-formula><jats:alternatives><jats:tex-math>$$[-1,1]^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msup><mml:mrow><mml:mo>[<\/mml:mo><mml:mo>-<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>,<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>]<\/mml:mo><\/mml:mrow><mml:mi>d<\/mml:mi><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>by the points of<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {Z}}_n$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>n<\/mml:mi><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and the problem of quality of coverage of<jats:inline-formula><jats:alternatives><jats:tex-math>$$[-1,1]^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msup><mml:mrow><mml:mo>[<\/mml:mo><mml:mo>-<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>,<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>]<\/mml:mo><\/mml:mrow><mml:mi>d<\/mml:mi><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>by<jats:inline-formula><jats:alternatives><jats:tex-math>$${{{\\mathcal {B}}}}_d({\\mathbb {Z}}_n,r)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:msub><mml:mi>B<\/mml:mi><mml:mi>d<\/mml:mi><\/mml:msub><mml:mrow><mml:mo>(<\/mml:mo><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>n<\/mml:mi><\/mml:msub><mml:mo>,<\/mml:mo><mml:mi>r<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, the union of balls centred at<jats:inline-formula><jats:alternatives><jats:tex-math>$$Z_j \\in {\\mathbb {Z}}_n$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>j<\/mml:mi><\/mml:msub><mml:mo>\u2208<\/mml:mo><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>n<\/mml:mi><\/mml:msub><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We concentrate on the cases where the dimension<jats:italic>d<\/jats:italic>is not small,<jats:inline-formula><jats:alternatives><jats:tex-math>$$d\\ge 5$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>d<\/mml:mi><mml:mo>\u2265<\/mml:mo><mml:mn>5<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, and<jats:italic>n<\/jats:italic>is not too large,<jats:inline-formula><jats:alternatives><jats:tex-math>$$n\\le 2^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>n<\/mml:mi><mml:mo>\u2264<\/mml:mo><mml:msup><mml:mn>2<\/mml:mn><mml:mi>d<\/mml:mi><\/mml:msup><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We define the design<jats:inline-formula><jats:alternatives><jats:tex-math>$${{\\mathbb {D}}_{n,\\delta }}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mi>D<\/mml:mi><mml:mrow><mml:mi>n<\/mml:mi><mml:mo>,<\/mml:mo><mml:mi>\u03b4<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>as a<jats:inline-formula><jats:alternatives><jats:tex-math>$$2^{d-1}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msup><mml:mn>2<\/mml:mn><mml:mrow><mml:mi>d<\/mml:mi><mml:mo>-<\/mml:mo><mml:mn>1<\/mml:mn><\/mml:mrow><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>design defined on vertices of the cube<jats:inline-formula><jats:alternatives><jats:tex-math>$$[-\\delta ,\\delta ]^d$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msup><mml:mrow><mml:mo>[<\/mml:mo><mml:mo>-<\/mml:mo><mml:mi>\u03b4<\/mml:mi><mml:mo>,<\/mml:mo><mml:mi>\u03b4<\/mml:mi><mml:mo>]<\/mml:mo><\/mml:mrow><mml:mi>d<\/mml:mi><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>,<jats:inline-formula><jats:alternatives><jats:tex-math>$$0\\le \\delta \\le 1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mn>0<\/mml:mn><mml:mo>\u2264<\/mml:mo><mml:mi>\u03b4<\/mml:mi><mml:mo>\u2264<\/mml:mo><mml:mn>1<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. For this design, we derive a closed-form expression for the quantisation error and very accurate approximations for the coverage area<jats:inline-formula><jats:alternatives><jats:tex-math>$${\\text {vol}}{([-1,1]^d \\cap {{{\\mathcal {B}}}}_d({\\mathbb {Z}}_n,r))}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mtext>vol<\/mml:mtext><mml:mrow><mml:mo>(<\/mml:mo><mml:msup><mml:mrow><mml:mo>[<\/mml:mo><mml:mo>-<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>,<\/mml:mo><mml:mn>1<\/mml:mn><mml:mo>]<\/mml:mo><\/mml:mrow><mml:mi>d<\/mml:mi><\/mml:msup><mml:mo>\u2229<\/mml:mo><mml:msub><mml:mi>B<\/mml:mi><mml:mi>d<\/mml:mi><\/mml:msub><mml:mrow><mml:mo>(<\/mml:mo><mml:msub><mml:mi>Z<\/mml:mi><mml:mi>n<\/mml:mi><\/mml:msub><mml:mo>,<\/mml:mo><mml:mi>r<\/mml:mi><mml:mo>)<\/mml:mo><\/mml:mrow><mml:mo>)<\/mml:mo><\/mml:mrow><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We provide results of a large-scale numerical investigation confirming the accuracy of the developed approximations and the efficiency of the designs\u00a0<jats:inline-formula><jats:alternatives><jats:tex-math>$${{\\mathbb {D}}_{n,\\delta }}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msub><mml:mi>D<\/mml:mi><mml:mrow><mml:mi>n<\/mml:mi><mml:mo>,<\/mml:mo><mml:mi>\u03b4<\/mml:mi><\/mml:mrow><\/mml:msub><\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00454-022-00396-7","type":"journal-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T14:03:20Z","timestamp":1654265000000},"page":"540-565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Quantisation and Weak Covering of High Dimensional Cubes"],"prefix":"10.1007","volume":"68","author":[{"given":"Jack","family":"Noonan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0630-8279","authenticated-orcid":false,"given":"Anatoly","family":"Zhigljavsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"key":"396_CR1","doi-asserted-by":"crossref","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups. Grundlehren der Mathematischen Wissenschaften, vol. 290. Springer, New York (1999)","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"396_CR2","doi-asserted-by":"crossref","unstructured":"Graf, S., Luschgy, H.: Foundations of Quantization for Probability Distributions. Lecture Notes in Mathematics, vol. 1730. Springer, Berlin (2000)","DOI":"10.1007\/BFb0103945"},{"key":"396_CR3","unstructured":"Kuo, F., Joe, S., Matsumoto, M., Mori, S., Saito, M.: Sobol sequences with better two-dimensional projections (2017). https:\/\/CRAN.R-project.org\/package=SobolSequence"},{"key":"396_CR4","doi-asserted-by":"crossref","unstructured":"Noonan, J., Zhigljavsky, A.: Non-lattice covering and quantization of high dimensional sets. In: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems, vol. 170, pp. 273\u2013318. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-66515-9_10"},{"key":"396_CR5","doi-asserted-by":"crossref","unstructured":"Petrov, V.V.: Sums of Independent Random Variables. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol. 82. Springer, New York (1975)","DOI":"10.1515\/9783112573006"},{"key":"396_CR6","doi-asserted-by":"crossref","unstructured":"Petrov, V.V.: Limit Theorems of Probability Theory. Sequences of Independent Random Variables. Oxford Studies in Probability, vol. 4. Oxford Science Publications. Oxford University Press, New York (1995)","DOI":"10.1093\/oso\/9780198534990.001.0001"},{"issue":"1","key":"396_CR7","first-page":"7","volume":"158","author":"L Pronzato","year":"2017","unstructured":"Pronzato, L.: Minimax and maximin space-filling designs: some properties and methods for construction. J. Soci\u00e9t\u00e9 Fran\u00e7aise de Stat. 158(1), 7\u201336 (2017)","journal-title":"J. Soci\u00e9t\u00e9 Fran\u00e7aise de Stat."},{"issue":"3","key":"396_CR8","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11222-011-9242-3","volume":"22","author":"L Pronzato","year":"2012","unstructured":"Pronzato, L., M\u00fcller, W.G.: Design of computer experiments: space filling and beyond. Stat. Comput. 22(3), 681\u2013701 (2012)","journal-title":"Stat. Comput."},{"issue":"3","key":"396_CR9","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/18M1210332","volume":"8","author":"L Pronzato","year":"2020","unstructured":"Pronzato, L., Zhigljavsky, A.: Bayesian quadrature, energy minimization, and space-filling design. SIAM\/ASA J. Uncertain. Quantif. 8(3), 959\u20131011 (2020)","journal-title":"SIAM\/ASA J. Uncertain. Quantif."},{"issue":"3\u20134","key":"396_CR10","first-page":"729","volume":"4","author":"Y Saka","year":"2007","unstructured":"Saka, Y., Gunzburger, M., Burkardt, J.: Latinized, improved LHS, and CVT point sets in hypercubes. Int. J. Numer. Anal. Model. 4(3\u20134), 729\u2013743 (2007)","journal-title":"Int. J. Numer. Anal. Model."},{"key":"396_CR11","doi-asserted-by":"crossref","unstructured":"Santner, T.J., Williams, B.J., Notz, W.I.: The Design and Analysis of Computer Experiments. Springer Series in Statistics. Springer, New York (2003)","DOI":"10.1007\/978-1-4757-3799-8"},{"key":"396_CR12","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1017\/S0962492906270016","volume":"15","author":"R Schaback","year":"2006","unstructured":"Schaback, R., Wendland, H.: Kernel techniques: from machine learning to meshless methods. Acta Numer. 15, 543\u2013639 (2006)","journal-title":"Acta Numer."},{"key":"396_CR13","unstructured":"Wendland, H.: Scattered Data Approximation. Cambridge Monographs on Applied and Computational Mathematics, vol. 17. Cambridge University Press, Cambridge (2005)"},{"issue":"3","key":"396_CR14","doi-asserted-by":"publisher","first-page":"#\u00a018","DOI":"10.1007\/s43069-020-0015-8","volume":"1","author":"A Zhigljavsky","year":"2020","unstructured":"Zhigljavsky, A., Noonan, J.: Covering of high-dimensional cubes and quantization. Oper. Res. Forum 1(3), #\u00a018 (2020)","journal-title":"Oper. Res. Forum"},{"key":"396_CR15","doi-asserted-by":"crossref","unstructured":"Zhigljavsky, A., \u017dilinskas, A.: Bayesian and High-Dimensional Global Optimization. SpringerBriefs in Optimization. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-64712-4"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00396-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-022-00396-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-022-00396-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T16:53:03Z","timestamp":1700671983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-022-00396-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["396"],"URL":"https:\/\/doi.org\/10.1007\/s00454-022-00396-7","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2022,6,3]]},"assertion":[{"value":"22 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}