Title
Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs
Abstract
The wrap-around L2-discrepancy has been used in quasi-Monte Carlo methods, especially in experimental designs. In this paper, explicit lower bounds of the wrap-around L2-discrepancy of U-type designs are obtained. Sufficient conditions for U-type designs to achieve their lower bounds are given. Taking advantage of these conditions, we consider the perfect resolvable balanced incomplete block designs, and use them to construct uniform designs under the wrap-around L2-discrepancy directly. We also propose an efficient balance-pursuit heuristic, by which we find many new uniform designs, especially with high levels. It is seen that the new algorithm is more powerful than existing threshold accepting ones in the literature.
Year
DOI
Venue
2005
10.1016/j.jco.2005.01.003
J. Complexity
Keywords
DocType
Volume
experimental design,wrap-around L2-discrepancy,efficient balance-pursuit heuristic,wrap- around l2-discrepancy,uniform designs,perfect rbibd,new algorithm,Lower bound,lower bound,uniform design,symmetrical uniform design,constructions,Perfect RBIBD,U-type design,wrap-around L,Uniform designs,explicit lower bound,new uniform design,high level,Wrap-around L 2 -discrepancy
Journal
21
Issue
ISSN
Citations 
5
Journal of Complexity
4
PageRank 
References 
Authors
0.57
5
3
Name
Order
Citations
PageRank
Kai-Tai Fang116523.65
Yu Tang2194.17
Jianxing Yin337330.16