arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2112.10401math.STcs.LGstat.MLstat.TH
收藏

具有最优和近似最优均匀常数的拟均匀设计

Quasi-uniform designs with optimal and near-optimal uniformity constant

CNRS, Université Côte d’Azur, I3S(法国国家科学研究中心,蔚蓝海岸大学,I3S实验室);Cardiff University(卡迪夫大学)

Luc Pronzato, Anatoly Zhigljavsky

摘要:

设计是给定集合$X$中的不同点的集合,该集合被假定为$R^d$的紧致子集,并且设计的网格比是其填充距离与其分离半径的比率。一系列套设计的均匀常数是设计的网格比的最小上界。我们推导出这个均匀常数的下界,并表明,一个简单的贪婪的建设达到这个下界。然后,我们扩展该计划,以允许更多的灵活性,在设计施工。

英文摘要:

A design is a collection of distinct points in a given set $X$, which is assumed to be a compact subset of $R^d$, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a sequence of nested designs is the smallest upper bound for the mesh-ratios of the designs. We derive a lower bound on this uniformity constant and show that a simple greedy construction achieves this lower bound. We then extend this scheme to allow more flexibility in the design construction.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑