Dependence in Stochastic Simulation Models

There is a growing need for the ability to model and generate samples of dependent random variables as primitive inputs to stochastic models. We consider the case where this dependence is modeled in terms of a partially-specified finite-dimensional random vector. A random vector sampler is commonly required to match a given set of distributions for each of its components (the marginal distributions) and values of their pairwise covariances. The NORTA method, which produces samples via a transformation of a joint-normal random vector sample, is considered the state-of-the-art method for matching this specification. We begin by showing that the NORTA method has certain flaws in its design which limit its applicability. A covariance matrix is said to be feasible for a given set of marginal distributions if a random vector exists with these properties. We develop a computational tool that can establish the feasibility of (almost) any covariance matrix for a fixed set of marginals. This tool is used to rigorously establish that there are feasible combinations of marginals and covariance matrices that the NORTA method cannot match. We further determine that as the dimension of the random vector increases, this problem rapidly becomes acute, in the sense that NORTA becomes increasingly likely to fail to match feasible specifications. As part of this analysis, we propose a random matrix sampling technique that is possibly of wider interest. We extend our study along two natural paths. First, we investigate whether NORTA can be modified to approximately match a desired covariance matrix that the original NORTA procedure fails to match. Results show that simple, elegant modifications to the NORTA procedure can help it achieve close approximations to the desired covariance matrix, and these modifications perform well with increasing dimension. Second, the feasibility testing procedure suggests a random vector sampling technique that can exactly match (almost) any given feasible set of marginals and covariances, i.e., be free of the limitations of NORTA. We develop a strong characterization of the computational effort needed by this new sampling technique. This technique is computationally competitive with NORTA in low to moderate dimensions, while matching the desired covariances exactly. Asansol (a border town of West Bengal, India) and, in keeping with the established social custom, got to name him Soumyadip. Noting with some concern their baby's apparent discomfort to the prevailing local culture, they decided to keep the family on the move, maintaining a remarkably consistent pace of …

[1]  Diane Valérie Ouellette Schur complements and statistics , 1981 .

[2]  R. Clemen,et al.  Correlations and Copulas for Decision and Risk Analysis , 1999 .

[3]  J. R. Sangwine-Yager,et al.  Bonnesen-style inequalities for Minkowski relative geometry , 1988 .

[4]  G. Dantzig Converting a Converging Algorithm into a Polynomially Bounded Algorithm , 1991 .

[5]  C. Richard Johnson,et al.  Matrix Completion Problems: A Survey , 1990 .

[6]  Joseph L. Hammond,et al.  Generation of Pseudorandom Numbers with Specified Univariate Distributions and Correlation Coefficients , 1975, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Noah Samuel Brannen The Wills conjecture , 1997 .

[8]  Philip M. Lurie,et al.  An Approximate Method for Sampling Correlated Random Variables From Partially-Specified Distributions , 1998 .

[9]  A. Edelman Eigenvalues and condition numbers of random matrices , 1988 .

[10]  Huifen Chen,et al.  Initialization for NORTA: Generation of Random Vectors with Specified Marginals and Correlations , 2001, INFORMS J. Comput..

[11]  Barry L. Nelson,et al.  Input modeling tools for complex problems , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[12]  P. A. G. van der Geest,et al.  An algorithm to generate samples of multi-variate distributions with correlated marginals , 1998 .

[13]  R. Schneider Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

[14]  D. Luenberger Optimization by Vector Space Methods , 1968 .

[15]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[16]  I. Olkin,et al.  Generating Correlation Matrices , 1984 .

[17]  Bruce W. Schmeiser,et al.  Beta Variate Generation via Exponential Majorizing Functions , 1980, Oper. Res..

[18]  Charles H. Reilly,et al.  The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance , 2000 .

[19]  Alastair J. Walker,et al.  An Efficient Method for Generating Discrete Random Variables with General Distributions , 1977, TOMS.

[20]  Gene H. Golub,et al.  Matrix computations , 1983 .

[21]  Rolf Schneider,et al.  Convex Surfaces, Curvature and Surface Area Measures , 1993 .

[22]  Shane G. Henderson,et al.  Chessboard distributions , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[23]  R. M. Cooke,et al.  CONDITIONAL , PARTIAL AND RANK CORRELATION FOR THE ELLIPTICAL COPULA ; DEPENDENCE MODELLING IN UNCERTAINTY ANALYSIS , 2001 .

[24]  R. Nelsen An Introduction to Copulas , 1998 .

[25]  W. Whitt Bivariate Distributions with Given Marginals , 1976 .

[26]  Charles L. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[27]  R. Iman,et al.  A distribution-free approach to inducing rank correlation among input variables , 1982 .

[28]  L. Devroye Non-Uniform Random Variate Generation , 1986 .

[29]  Louis Guttman,et al.  Enlargement Methods for Computing the Inverse Matrix , 1946 .

[30]  Charles H. Reilly,et al.  Composition for multivariate random variables , 1994, Proceedings of Winter Simulation Conference.

[31]  M. Sklar Fonctions de repartition a n dimensions et leurs marges , 1959 .

[32]  P. Dean Simulation of Experiments. , 1972 .

[33]  Shane G. Henderson,et al.  Mathematics for simulation , 2000, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[34]  Satishs Iyengar,et al.  Multivariate Models and Dependence Concepts , 1998 .

[35]  R. Saigal,et al.  Handbook of semidefinite programming : theory, algorithms, and applications , 2000 .