Book ChapterDOI
Convergence of probability measures
Richard F. Bass
- pp 237-243
Reads0
Chats0
TLDR
Weakconvergence methods in metric spaces were studied in this article, with applications sufficient to show their power and utility, and the results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables.Abstract:
The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is anread more
Citations
More filters
Book
Large Networks and Graph Limits
TL;DR: Laszlo Lovasz has written an admirable treatise on the exciting new theory of graph limits and graph homomorphisms, an area of great importance in the study of large networks.
Book
Multidimensional Stochastic Processes as Rough Paths
Peter K. Friz,Nicolas B. Victoir +1 more
TL;DR: Rough path analysis provides a fresh perspective on Ito's important theory of stochastic differential equations as mentioned in this paper, and it has been used extensively in the analysis of partial differential equations.
Book ChapterDOI
Pure exploration in multi-armed bandits problems
TL;DR: The main result is that the required exploration-exploitation trade-offs are qualitatively different, in view of a general lower bound on the simple regret in terms of the cumulative regret.
Journal ArticleDOI
On the limits of communication with low-precision analog-to-digital conversion at the receiver
TL;DR: This work evaluates the communication limits imposed by low-precision ADC for transmission over the real discrete-time additive white Gaussian noise (AWGN) channel, under an average power constraint on the input.
Book
Lectures on the Poisson Process
TL;DR: In this article, the authors developed the theory of the Poisson process in the setting of a general abstract measure space, establishing basic results and properties as well as certain advanced topics in the stochastic analysis of the poisson process.
References
More filters
Journal ArticleDOI
Mean Field Equilibrium in Dynamic Games with Strategic Complementarities
Sachin Adlakha,Ramesh Johari +1 more
TL;DR: This work finds necessary conditions for the existence of a mean field equilibrium in stochastic dynamic games that exhibit strategic complementarities between players, and shows that there exist a “largest” and a ”smallest” equilibrium among all those where the equilibrium strategy used by a player is nondecreasing.
Proceedings ArticleDOI
Performance Analysis of Contention Based Medium Access Control Protocols
TL;DR: A simple and accurate technique for estimating the throughput of the IEEE 802.11 DCF protocol is developed, based on a rigorous analysis of the Markov chain that corresponds to the time evolution of the back-off processes at the contending nodes.
Journal ArticleDOI
A simple test of changes in mean in the possible presence of long‐range dependence
TL;DR: In this paper, the authors propose a simple testing procedure to test for a change point in the mean of a possibly long-range dependent time series, and demonstrate the good size and power properties of their test via simulations and illustrate its usefulness by analyzing two real data sets.
Journal ArticleDOI
Why saturated probability spaces are necessary
H. Jerome Keisler,Yeneng Sun +1 more
TL;DR: In this paper, it was shown that any probability space which has the saturation property for just one good enough measure, or which satisfies just one “good enough” instance of the desirable properties, must already be saturated.
Journal ArticleDOI
Estimation for a nonstationary semi-strong garch(1,1) model with heavy-tailed errors
TL;DR: In this article, the estimation of a semi-strong GARCH(1,1) model without a stationary solution was studied and it was shown that the least absolute deviations estimator is always asymptotically normal.