TL;DR: In this article, Gradient flows and curves of Maximal slopes of the Wasserstein distance along geodesics are used to measure the optimal transportation problem in the space of probability measures.
Abstract: Notation.- Notation.- Gradient Flow in Metric Spaces.- Curves and Gradients in Metric Spaces.- Existence of Curves of Maximal Slope and their Variational Approximation.- Proofs of the Convergence Theorems.- Uniqueness, Generation of Contraction Semigroups, Error Estimates.- Gradient Flow in the Space of Probability Measures.- Preliminary Results on Measure Theory.- The Optimal Transportation Problem.- The Wasserstein Distance and its Behaviour along Geodesics.- Absolutely Continuous Curves in p(X) and the Continuity Equation.- Convex Functionals in p(X).- Metric Slope and Subdifferential Calculus in (X).- Gradient Flows and Curves of Maximal Slope in p(X).
TL;DR: Weak Convergence in Metric Spaces as discussed by the authors is one of the most common modes of convergence in metric spaces, and it can be seen as a form of weak convergence in metric space.
Abstract: Weak Convergence in Metric Spaces. The Space C. The Space D. Dependent Variables. Other Modes of Convergence. Appendix. Some Notes on the Problems. Bibliographical Notes. Bibliography. Index.
TL;DR: A metric for probability distributions is introduced, which is bounded, information-theoretically motivated, and has a natural Bayesian interpretation, and the square root of the well-known /spl chi//sup 2/ distance is an asymptotic approximation.
Abstract: We introduce a metric for probability distributions, which is bounded, information-theoretically motivated, and has a natural Bayesian interpretation. The square root of the well-known /spl chi//sup 2/ distance is an asymptotic approximation to it. Moreover, it is a close relative of the capacitory discrimination and Jensen-Shannon divergence.
TL;DR: In this paper, a general method of obtaining and bounding the error in approximating the distribution of the dependent Bernoulli random variables by the Poisson distribution is presented, which is similar to that of Charles Stein (1970) in his paper on normal approximation for dependent random variables.
Abstract: Let $X_1, \cdots, X_n$ be an arbitrary sequence of dependent Bernoulli random variables with $P(X_i = 1) = 1 - P(X_i = 0) = p_i.$ This paper establishes a general method of obtaining and bounding the error in approximating the distribution of $\sum^n_{i=1} X_i$ by the Poisson distribution. A few approximation theorems are proved under the mixing condition of Ibragimov (1959), (1962). One of them yields, as a special case and with some improvement, an approximation theorem of Le Cam (1960) for the Poisson binomial distribution. The possibility of an asymptotic expansion is also discussed and a refinement in the independent case obtained. The method is similar to that of Charles Stein (1970) in his paper on the normal approximation for dependent random variables.
TL;DR: In this paper, Stein's method is used for non-linear statistics and multivariate normal approximations for independent random variables with moderate deviations, and a non-normal approximation for nonlinear statistics.
Abstract: Preface.- 1.Introduction.- 2.Fundamentals of Stein's Method.- 3.Berry-Esseen Bounds for Independent Random Variables.- 4.L^1 Bounds.- 5.L^1 by Bounded Couplings.- 6 L^1: Applications.- 7.Non-uniform Bounds for Independent Random Variables.- 8.Uniform and Non-uniform Bounds under Local Dependence.- 9.Uniform and Non-Uniform Bounds for Non-linear Statistics.- 10.Moderate Deviations.- 11.Multivariate Normal Approximation.- 12.Discretized normal approximation.- 13.Non-normal Approximation.- 14.Extensions.- References.- Author Index .- Subject Index.- Notation.