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
On asymptotic constants in the theory of extremes for Gaussian processes
A. B. Dieker,Benjamin Yakir +1 more
TL;DR: This paper gives a new representation of Pickands' constants, which arise in the study of extremes for a variety of Gaussian processes, and resolves the long-standing problem of devising a reliable algorithm for estimating these constants.
Posted Content
KPZ line ensemble
TL;DR: In this article, the authors constructed an ensemble of random continuous curves with three properties: 1. The lowest index curve is distributed as the time $t$ Hopf-Cole solution to the Kardar-Parisi-Zhang (KPZ) stochastic PDE with narrow wedge initial data; 2. The entire ensemble satisfies a resampling invariance which is called the $\mathbf{H}$-Brownian Gibbs property (with $\mathBF{H(x)=e^{x}$); 3. Concentration in the $t^{2
Journal ArticleDOI
Distributed Algorithms for Computation of Centrality Measures in Complex Networks
Keyou You,Roberto Tempo,Li Qiu +2 more
TL;DR: Deterministic algorithms, which converge in finite time, are proposed for the distributed computation of the degree, closeness and betweenness centrality measures in directed graphs and the concept of persistent graph is introduced, which eliminates the effect of spamming nodes.
Journal ArticleDOI
Stochastic NonLinear Wave Equations in Local Sobolev Spaces
TL;DR: In this article, weak solutions of stochastic wave equations with nonlinearities of a critical growth driven by spatially homogeneous Wiener processes are established in local Sobolev spaces and local energy estimates for these solutions are proved.
Journal ArticleDOI
Worst-Case Additive Noise in Wireless Networks
TL;DR: In this paper, it was shown that the Gaussian noise is also the worst-case additive noise in wireless networks with additive noises that are independent from the transmit signals, and that if the noise variance at each node is fixed, then the capacity region with Gaussian noises is a subset of the capacity regions with any other set of noise distributions.