Home
Hostname: page-component-79b67bcb76-c2bf7 Total loading time: 0.174 Render date: 2021-05-15T09:38:18.583Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true } Advances in Applied Probability

# Approximation of bounds on mixed-level orthogonal arrays

Published online by Cambridge University Press:  01 July 2016

Corresponding

## Abstract

Mixed-level orthogonal arrays are basic structures in experimental design. We develop three algorithms that compute Rao- and Gilbert-Varshamov-type bounds for mixed-level orthogonal arrays. The computational complexity of the terms involved in the original combinatorial representations of these bounds can grow fast as the parameters of the arrays increase and this justifies the construction of these algorithms. The first is a recursive algorithm that computes the bounds exactly, the second is based on an asymptotic analysis, and the third is a simulation algorithm. They are all based on the representation of the combinatorial expressions that appear in the bounds as expectations involving a symmetric random walk. The Markov property of the underlying random walk gives the recursive formula to compute the expectations. A large deviation (LD) analysis of the expectations provides the asymptotic algorithm. The asymptotically optimal importance sampling (IS) of the same expectation provides the simulation algorithm. Both the LD analysis and the construction of the IS algorithm use a representation of these problems as a sequence of stochastic optimal control problems converging to a limit calculus of a variations problem. The construction of the IS algorithm uses a recently discovered method of using subsolutions to the Hamilton-Jacobi-Bellman equations associated with the limit problem.

## MSC classification

Type
General Applied Probability
Information
Advances in Applied Probability , June 2011 , pp. 399 - 421

## References

Blanchet, J. H. (2007). Efficient importance sampling for binary contingency tables. Preprint. Available at http://arxiv.org/abs/0908.0999v1.Google Scholar
Blanchet, J. H., Glynn, P. and Leder, K. (2009). On Lyapunov inequalities and subsolutions for efficient importance sampling. Preprint.Google Scholar
Blanchet, J. H., Leder, K. and Glynn, P. W. (2008). Efficient simulation of light-tailed sums: an old folk song sung to a faster new tune. In Monte Carlo and Quasi-Monte Carlo Methods 2008, eds Ecuyer, P. L. and Owen, A. B., Springer, Berlin, pp. 227248.Google Scholar
Blitzstein, J. and Diaconis, P. (2006). A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Preprint.Google Scholar
Chen, Y., Dinwoodie, I. H. and Sullivant, S. (2006). Sequential importance sampling for multiway tables. Ann. Statist 34, 523545.CrossRefGoogle Scholar
Chen, Y., Diaconis, P., Holmes, S. P. and Liu, J. S. (2005). Sequential Monte Carlo methods for statistical analysis of tables. J. Amer. Statist. Assoc. 100, 109120.CrossRefGoogle Scholar
Dembo, A. and Zeitouni, O. (1998). Large Deviations Techniques and Applications (Appl. Math. 38), 2nd edn. Springer, New York.CrossRefGoogle Scholar
Dupuis, P. and Ellis, R. S. (1997). A Weak Convergence Approach to the Theory of Large Deviations. John Wiley, New York.CrossRefGoogle Scholar
Dupuis, P. and Wang, H. (2004). Importance sampling, large deviations, and differential games. Stoch. Stoch. Reports 76, 481508.CrossRefGoogle Scholar
Dupuis, P. and Wang, H. (2005). Adaptive importance sampling for uniformly recurrent Markov chains. Ann. Appl. Prob. 15, 138.CrossRefGoogle Scholar
Dupuis, P. and Wang, H. (2005). Subsolutions of an Isaacs equation and efficient schemes for importance sampling: convergence analysis. Preprint. Available at http://www.dam.brown.edu/people/huiwang.CrossRefGoogle Scholar
Dupuis, P. and Wang, H. (2005). Subsolutions of an Isaacs equation and efficient schemes for importance sampling: examples and numerics. Preprint. Available at http://www.dam.brown.edu/lcds/publications.CrossRefGoogle Scholar
Dupuis, P., Ishii, H. and Soner, H. M. (1990). A viscosity solution approach to the asymptotic analysis of queueing systems. Ann. Prob. 18, 226255.CrossRefGoogle Scholar
Dupuis, P., Leder, K. and Wang, H. (2007). Large deviations and importance sampling for a tandem network with slow-down. Queueing Systems 57, 7183.CrossRefGoogle Scholar
Dupuis, P., Sezer, A. D. and Wang, H. (2007). Dynamic importance sampling for queueing networks. Ann. Appl. Prob. 17, 13061346.CrossRefGoogle Scholar
Eaton, J. W. (2002). GNU Octave Manual. Network Theory Limited.Google Scholar
Feng, K., Xu, L. and Hickernell, F. J. (2006). Linear error-block codes. Finite Fields Appl. 12, 638652.CrossRefGoogle Scholar
Fleming, W. H. (1977/78). Exit probabilities and optimal stochastic control. Appl. Math. Optimization 4, 329346.CrossRefGoogle Scholar
Fleming, W. H. and Soner, H. M. (1992). Controlled Markov Processes and Viscosity Solutions. Springer, New York.Google Scholar
Fleming, W. H. and Tsai, C. P. (1981). Optimal exit probabilities and differential games. Appl. Math. Optimization 7, 253282.CrossRefGoogle Scholar
Glasserman, P. (2004). Monte Carlo Methods in Financial Engineering. (Appl. Math. 53). Springer, New York.Google Scholar
Glasserman, P. and Kou, S.-G. (1995). Analysis of an importance sampling estimator for tandem queues. ACM Trans. Model and Comput. Simul. 5, 2242.CrossRefGoogle Scholar
Goertzel, G. (1949). Quota sampling and importance functions in stochastic solution of particle problems. Tech. Rep. 434, Oak Ridge National Laboratory.Google Scholar
Hammersley, J. M. and Handscomb, D. C. (1964). Monte Carlo Methods. Methuen & Co, London.CrossRefGoogle Scholar
Hedayat, A. S., Sloane, N. J. A. and Stufken, J. (1999). Orthogonal Arrays. Springer, New York.CrossRefGoogle Scholar
Ling, S. and Özbudak, F. (2007). Constructions and bounds on linear error-block codes. Des. Codes Cryptogr. 45, 297316.CrossRefGoogle Scholar
MacWilliams, F. J. and Sloane, N. J. A. (1977). The Theory of Error-Correcting Codes. I. North-Holland, Amsterdam.Google Scholar
MacWilliams, F. J. and Sloane, N. J. A. (1977). The Theory of Error-Correcting Codes. II. North-Holland, Amsterdam.Google Scholar
Niederreiter, H. and Özbudak, F. (2007). Improved asymptotic bounds for codes using distinguished divisors of global function fields. SIAM J. Discrete Math. 21, 865899.CrossRefGoogle Scholar
Parekh, S. and Walrand, J. (1989). A quick simulation method for excessive backlogs in networks of queues. IEEE Trans. Automatic Control 34, 5466.CrossRefGoogle Scholar
Radhakrishna Rao, C. (1947). Factorial experiments derivable from combinatorial arrangements of arrays. Suppl. J. R. Statist. Soc. 9, 128139.Google Scholar
Sezer, A. D. (2005). Dynamic importance sampling for queueing networks. , Division of Applied Mathematics, Brown University.Google Scholar
Sezer, A. D. (2008). Asymptotically optimal importance sampling for Jackson networks with a tree topology. Preprint. Available at http://arxiv.org/abs/0708.3260v3.Google Scholar
Sezer, A. D. (2009). Importance sampling for a Markov modulated queuing network. Stoch. Process. Appl. 119, 491517.CrossRefGoogle Scholar
Siegmund, D. (1976). Importance sampling in the Monte Carlo study of sequential tests. Ann. Statist. 4, 673684.CrossRefGoogle Scholar You have Access

# Send article to Kindle

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Approximation of bounds on mixed-level orthogonal arrays
Available formats
×

# Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Approximation of bounds on mixed-level orthogonal arrays
Available formats
×

# Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Approximation of bounds on mixed-level orthogonal arrays
Available formats
×
×