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
Journal ArticleDOI
Convergence of the Complex Envelope of Bandlimited OFDM Signals
TL;DR: It is established that the complex envelope of a bandlimited uncoded OFDM signal converges weakly to a Gaussian random process as the number of subcarriers goes to infinity.
Journal ArticleDOI
Testing for a change in correlation at an unknown point in time using an extended functional delta method
TL;DR: In this paper, a new test against a change in correlation at an unknown point in time based on cumulated sums of empirical correlations is proposed, which does not require that inputs are independent and identically distributed under the null.
Journal ArticleDOI
State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
TL;DR: A connection-level model of Internet congestion control that represents the randomly varying number of flows present in a network is considered and a property called multiplicative state space collapse is derived, which shows that in diffusion scale, the flow count process for the stochastic model can be approximately recovered as a continuous lifting of the workload process.
γ-Radonifying Operators: A Survey
TL;DR: In this paper, a survey of the theory of γ-radonifying operators and its applications to stochastic integration in Banach spaces is presented, with a focus on the application of the γradonification operator to the integration problem.
Posted Content
Bayesian Deep Convolutional Networks with Many Channels are Gaussian Processes
Roman Novak,Lechao Xiao,Jaehoon Lee,Yasaman Bahri,Greg Yang,Jiri Hron,Daniel A. Abolafia,Jeffrey Pennington,Jascha Sohl-Dickstein +8 more
TL;DR: In this article, an equivalence between wide fully connected neural networks (FCNs) and Gaussian processes (GPs) was derived for CNNs both with and without pooling layers, and achieved state-of-the-art results on CIFAR10 for GPs without trainable kernels.
References
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.
Posted Content
Certifying Some Distributional Robustness with Principled Adversarial Training
TL;DR: In this paper, a training procedure that augments model parameter updates with worst-case perturbations of training data is proposed to guarantee moderate levels of robustness with little computational or statistical cost relative to empirical risk minimization.
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.