Results 1  10
of
22
Inversive Congruential Pseudorandom Numbers: Distribution Of Triples
, 1997
"... This paper deals with the inversive congruential method with power of two modulus m for generating uniform pseudorandom numbers. Statistical independence properties of the generated sequences are studied based on the distribution of triples of successive pseudorandom numbers. It is shown that, on th ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
(Show Context)
This paper deals with the inversive congruential method with power of two modulus m for generating uniform pseudorandom numbers. Statistical independence properties of the generated sequences are studied based on the distribution of triples of successive pseudorandom numbers. It is shown that, on the average over the parameters in the inversive congruential method, the discrepancy of the corresponding point sets in the unit cube is of an order of magnitude between m \Gamma1=2 and m \Gamma1=2 (log m)³. The method of proof relies on a detailed discussion of the properties of certain exponential sums.
Bounds for the uniform deviation of empirical measures
 Journal of Multivariate Analysis
, 1982
"... If x,)...) X, are independent identically distributed Rdvalued random vectors with probability measure p and empirical probability measure p,, and if QZ is a subset of the Bore1 sets on Rd, then we show that P{sup,, ~ ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
If x,)...) X, are independent identically distributed Rdvalued random vectors with probability measure p and empirical probability measure p,, and if QZ is a subset of the Bore1 sets on Rd, then we show that P{sup,, ~
The inverse of the stardiscrepancy depends linearly on the dimension
 ACTA ARITHMETICA 96
, 2001
"... We study bounds on the classical ∗discrepancy and on its inverse. Let n ∗ ∞(d, ε) be the inverse of the ∗discrepancy, i.e., the minimal number of points in dimension d with the ∗discrepancy at most ε. We prove that n ∗ ∞(d, ε) depends linearly on d and at most quadratically on ε −1. We present t ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
(Show Context)
We study bounds on the classical ∗discrepancy and on its inverse. Let n ∗ ∞(d, ε) be the inverse of the ∗discrepancy, i.e., the minimal number of points in dimension d with the ∗discrepancy at most ε. We prove that n ∗ ∞(d, ε) depends linearly on d and at most quadratically on ε −1. We present three upper bounds on n ∗ ∞(d, ε), all of them are based on probabilistic arguments and therefore they are nonconstructive. The linear in d upper bound directly follows from deep results of the theory of empirical processes but it contains an unknown multiplicative factor. Two other upper bounds are without unknown factors but do not yield the linear (in d) upper bound. One upper bound is based on an average case analysis for the Lpstar discrepancy and our numerical results seem to indicate that it gives the best estimates for specific values of d and ε. We also present two lower bounds on n ∗ ∞(d, ε). For lower bounds, we allow arbitrary coefficients in the discrepancy formula. We prove that n ∗ ∞(d, ε) must be of order d log ε −1 and, roughly, of order d λ ε −(1−λ) for any λ ∈ (0, 1).
Lipschitz Stability For Stochastic Programs With Complete Recourse
"... This paper investigates the stability of optimalsolution sets to stochastic programs with complete recourse, where the underlying probability measure is understood as a parameter varying in some space of probability measures. In [29] Shapiro has proved Lipschitz upper semicontinuity of the solution ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
This paper investigates the stability of optimalsolution sets to stochastic programs with complete recourse, where the underlying probability measure is understood as a parameter varying in some space of probability measures. In [29] Shapiro has proved Lipschitz upper semicontinuity of the solution set mapping. Inspired by this result we introduce a subgradient distance for probability distributions and establish the persistence of optimal solutions. For a subclass of recourse models we show that the solution set mapping is (Hausdorff) Lipschitz continuous with respect to the subgradient distance. Moreover, the subgradient distance is estimated above by the KolmogorovSmirnov distance of certain distribution functions related to the recourse model. The Lipschitz continuity result is illustrated by verifiable sufficient conditions for stochastic programs to belong to the mentioned subclass and by examples showing its validity and limitations. Finally, the Lipschitz continuity result ...
Variance reduction in gibbs sampler using quasi random numbers
 Journal of Computational and Graphical Statistics
, 1998
"... ..."
Tolerance Analysis for Design of Multistage Manufacturing Processes using NumberTheoretical Net Method (NTnet
 International Journal of Flexible Manufacturing Systems
, 2004
"... Abstract. Recent developments in modeling stream of variation in multistage manufacturing system along with the urgent need for yield enhancement in the semiconductor industry has led to complex large scale simulation problems in design and performance prediction, thus challenging current Monte Carl ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Recent developments in modeling stream of variation in multistage manufacturing system along with the urgent need for yield enhancement in the semiconductor industry has led to complex large scale simulation problems in design and performance prediction, thus challenging current Monte Carlo (MC) based simulation techniques. MC method prevails in statistical simulation approaches for multidimensional cases with general (i.e., nonGaussian) distributions and/or complex response functions. A method is proposed based on number theory (NTnet) to reduce computing effort and the variability of MC’s results in tolerance design and circuit performance simulation. The sampling strategy is improved by introducing NTnet that can provide better convergent rate over MC. The new method is presented and verified using several case studies, including analytical and industrial cases of a filter design and analyses of a fourbar mechanism. Results indicate a 90–95 % reduction of computation effort with significant improvement in accuracy that can be achieved by the proposed technique. Key Words: tolerance analysis, Monte Carlo simulation
NONPARAMETRIC DENSITY ESTIMATION FOR MULTIVARIATE BOUNDED DATA
, 2007
"... We propose a new nonparametric estimator for the density function of multivariate bounded data. As frequently observed in practice, the variables may be partially bounded (e.g., nonnegative) or completely bounded (e.g., in the unit interval). In addition, the variables may have a point mass. We redu ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We propose a new nonparametric estimator for the density function of multivariate bounded data. As frequently observed in practice, the variables may be partially bounded (e.g., nonnegative) or completely bounded (e.g., in the unit interval). In addition, the variables may have a point mass. We reduce the conditions on the underlying density to a minimum by proposing a nonparametric approach. By using a gamma, a beta, or a local linear kernel (also called boundary kernels), in a product kernel, the suggested estimator becomes simple in implementation and robust to the well known boundary bias problem. We investigate the mean integrated squared error properties, including the rate of convergence, uniform strong consistency and asymptotic normality. We establish consistency of the least squares crossvalidation method to select optimal bandwidth parameters. A detailed simulation study investigates the performance of the estimators. Applications using lottery and corporate finance data are provided. Key words and phrases. Asymmetric kernels, multivariate boundary bias, nonparametric multivariate density estimation, asymptotic properties, bandwidth selection, least squares crossvalidation.
Institutions and Economic Outcomes: A DominanceBased Analysis
 Econometric Reviews
, 2012
"... An important issue in both welfare and development economics is the interaction between institutions and economic outcomes. While welfarists are typically concerned with how these variables contribute to overall wellbeing, empirical assessments of their joint contribution are limited. Development e ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
An important issue in both welfare and development economics is the interaction between institutions and economic outcomes. While welfarists are typically concerned with how these variables contribute to overall wellbeing, empirical assessments of their joint contribution are limited. Development economists, on the other hand, have focused extensively on whether institutions cause or are caused by growth yet the relevant literature is still rife with debate. In this paper, we use a notion of distributional dominance to tackle both the measurement of multivariate welfare and the evaluation of intertemporal dependence without hindrance from the mix of discrete (political) and continuous (economic) variables in our data set. On the causality front, our results support the view that institutions promote growth more than growth promotes institutions. On the welfare front, we
nd that economic growth had a positive impact from 1960 to 2000 but declines in institutional quality over the earlier part of this period were su ¢ cient to produce a decline in overall wellbeing until the mid1970s. Subsequent improvements in institutions then reversed the trend and, ultimately, wellbeing in 2000 was higher than that in 1960.