About: Continuous mapping theorem is a research topic. Over the lifetime, 282 publications have been published within this topic receiving 20915 citations.
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: In this paper, the authors define a functional on Stochastic Processes as random functions and propose a uniform convergence of empirical measures in Euclidean spaces, based on the notion of convergence in distribution.
Abstract: I Functional on Stochastic Processes.- 1. Stochastic Processes as Random Functions.- Notes.- Problems.- II Uniform Convergence of Empirical Measures.- 1. Uniformity and Consistency.- 2. Direct Approximation.- 3. The Combinatorial Method.- 4. Classes of Sets with Polynomial Discrimination.- 5. Classes of Functions.- 6. Rates of Convergence.- Notes.- Problems.- III Convergence in Distribution in Euclidean Spaces.- 1. The Definition.- 2. The Continuous Mapping Theorem.- 3. Expectations of Smooth Functions.- 4. The Central Limit Theorem.- 5. Characteristic Functions.- 6. Quantile Transformations and Almost Sure Representations.- Notes.- Problems.- IV Convergence in Distribution in Metric Spaces.- 1. Measurability.- 2. The Continuous Mapping Theorem.- 3. Representation by Almost Surely Convergent Sequences.- 4. Coupling.- 5. Weakly Convergent Subsequences.- Notes.- Problems.- V The Uniform Metric on Spaces of Cadlag Functions.- 1. Approximation of Stochastic Processes.- 2. Empirical Processes.- 3. Existence of Brownian Bridge and Brownian Motion.- 4. Processes with Independent Increments.- 5. Infinite Time Scales.- 6. Functional of Brownian Motion and Brownian Bridge.- Notes.- Problems.- VI The Skorohod Metric on D(0, ?).- 1. Properties of the Metric.- 2. Convergence in Distribution.- Notes.- Problems.- VII Central Limit Theorems.- 1. Stochastic Equicontinuity.- 2. Chaining.- 3. Gaussian Processes.- 4. Random Covering Numbers.- 5. Empirical Central Limit Theorems.- 6. Restricted Chaining.- Notes.- Problems.- VIII Martingales.- 1. A Central Limit Theorem for Martingale-Difference Arrays.- 2. Continuous Time Martingales.- 3. Estimation from Censored Data.- Notes.- Problems.- Appendix A Stochastic-Order Symbols.- Appendix B Exponential Inequalities.- Notes.- Problems.- Appendix C Measurability.- Notes.- Problems.- References.- Author Index.
TL;DR: In this paper, the authors show that the continuous mapping theorem can be invoked to obtain asymptotic distributions and corresponding rates of convergence for change-point estimators, which are typically faster than n- 1/2.
Abstract: an otherwise smooth regression model are proposed. The assumptions needed are much weaker than those made in parametric models. The proposed estimators apply as well to the detection of discontinuities in derivatives and therefore to the detection of change-points of slope and of higher order curvature. The proposed estimators are based on a comparison of left and right one-sided kernel smoothers. Weak convergence of a stochastic process in local differences to a Gaussian process is established for properly scaled versions of estimators of the location of a change-point. The continuous mapping theorem can then be invoked to obtain asymptotic distributions and corresponding rates of convergence for change-point estimators. These rates are typically faster than n- 1/2. Rates of global LP convergence of curve estimates with appropriate kernel modifications adapting to estimated change-points are derived as a consequence. It is shown that these rates of convergence are the same as if the location of the change-point was known. The methods are illustrated by means of the well known data on the annual flow volume of the Nile river between 1871 and 1970. 1. Introduction. Nonparametric regression methods are usually applied in order to obtain a smooth fit of a regression curve without having to specify a parametric class of regression functions. Sometimes a generally smooth curve might contain an isolated discontinuity or change-point in the curve or in a (possibly higher order) derivative, and in many cases interest focuses on the occurrence of such change-points. In parametric approaches to the regression change-point problem, simple linear regressions before and after a possible change-point are assumed, and then the possibility of a discontinuity in the form of a jump or of a jump in the first derivative, or, equivalently, a slope change, is incorporated into the model; see for instance Hinkley (1969) and Brown, Durbin and Evans (1975). The analysis of change-points which describe sudden, localized changes typically occurring in economics, medicine and the physical sciences has recently found increasing interest. General smoothness assumptions, allowing for a large class of regression functions to be considered, seem to be more appropriate in a variety of applied problems than parametric modelling. An
TL;DR: In this paper, the authors illustrate the "martingale method" for proving many-server heavy-traffic stochastic process limits for queueing models, supporting diffusion-process approximations.
Abstract: This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an elementary model -- the classical infinite-server model $M/M/\infty$, but models with finitely many servers and customer abandonment are also treated. The Markovian stochastic process representing the number of customers in the system is constructed in terms of rate-1 Poisson processes in two ways: (i) through random time changes and (ii) through random thinnings. Associated martingale representations are obtained for these constructions by applying, respectively: (i) optional stopping theorems where the random time changes are the stopping times and (ii) the integration theorem associated with random thinning of a counting process. Convergence to the diffusion process limit for the appropriate sequence of scaled queueing processes is obtained by applying the continuous mapping theorem. A key FCLT and a key FWLLN in this framework are established both with and without applying martingales.
TL;DR: In this article, the authors illustrate the "martin-gale method" for proving many-server heavy-traffic stochastic-process lim- its for queueing models, supporting diffusion-process approximations.
Abstract: This is an expository review paper illustrating the "martin- gale method" for proving many-server heavy-traffic stochastic-process lim- its for queueing models, supporting diffusion-process approximations. Care- ful treatment is given to an elementary model - the classical infinite-server model M/M/1, but models with finitely many servers and customer aban- donment are also treated. The Markovian stochastic process representing the number of customers in the system is constructed in terms of rate- 1 Poisson processes in two ways: (i) through random time changes and (ii) through random thinnings. Associated martingale representations are obtained for these constructions by applying, respectively: (i) optional stop- ping theorems where the random time changes are the stopping times and (ii) the integration theorem associated with random thinning of a counting process. Convergence to the diffusion process limit for the appropriate se- quence of scaled queueing processes is obtained by applying the continuous mapping theorem. A key FCLT and a key FWLLN in this framework are established both with and without applying martingales.