Stochastic ordering

Abstract: Introduction.- Doubly Stochastic Matrices.- Schur-Convex Functions.- Equivalent Conditions for Majorization.- Preservation and Generation of Majorization.- Rearrangements and Majorization.- Combinatorial Analysis.- Geometric Inequalities.- Matrix Theory.- Numerical Analysis.- Stochastic Majorizations.- Probabilistic, Statistical, and Other Applications.- Additional Statistical Applications.- Orderings Extending Majorization.- Multivariate Majorization.- Convex Functions and Some Classical Inequalities.- Stochastic Ordering.- Total Positivity.- Matrix Factorizations, Compounds, Direct Products, and M-Matrices.- Extremal Representations of Matrix Functions.

Abstract: General Theory. Applications in Statistics. Applications in Biology. Applications in Economics. Applications in Operations Research. Applications in Reliability Theory.

Abstract: Preface. Univariate Stochastic Orders Theory of Integral Stochastic Orders Multivariate Stochastic Orders Stochastic Models, Comparison and Monotonicity Monotonicity and Comparability of Stochastic Processes Monotonicity Properties and Bounds for Queueing Systems Applications to Various Stochastic Models Comparing Risks. List of Symbols. References. Index.

Abstract: 1 Discrete Part Manufacturing Systems 2 Evolution of Manufacturing System Models: An Example 3 Single Stage 'Produce-to-Order' Systems 4 Single Stage 'Produce-to-Stock' Systems 5 Flow Lines 6 Transfer Lines 7 Dynamic Job Shops 8 Flexible Machining Systems 9 Flexible Assembly Systems 10 Multiple Cell Manufacturing Systems 11 Unresolved Issues: Directions for Future Research Appendix A: Standard Probability Distributions Appendix B: Some Notions of Stochastic Ordering Appendix C: Nonparametric Families of Distributions

Abstract: Recently there has been a growing interest in designing efficient methods for the solution of ordinary/partial differential equations with random inputs. To this end, stochastic Galerkin methods appear to be superior to other nonsampling methods and, in many cases, to several sampling methods. However, when the governing equations take complicated forms, numerical implementations of stochastic Galerkin methods can become nontrivial and care is needed to design robust and efficient solvers for the resulting equations. On the other hand, the traditional sampling methods, e.g., Monte Carlo methods, are straightforward to implement, but they do not offer convergence as fast as stochastic Galerkin methods. In this paper, a high-order stochastic collocation approach is proposed. Similar to stochastic Galerkin methods, the collocation methods take advantage of an assumption of smoothness of the solution in random space to achieve fast convergence. However, the numerical implementation of stochastic collocation is trivial, as it requires only repetitive runs of an existing deterministic solver, similar to Monte Carlo methods. The computational cost of the collocation methods depends on the choice of the collocation points, and we present several feasible constructions. One particular choice, based on sparse grids, depends weakly on the dimensionality of the random space and is more suitable for highly accurate computations of practical applications with large dimensional random inputs. Numerical examples are presented to demonstrate the accuracy and efficiency of the stochastic collocation methods.