We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Convergence of Probability Measures

In the field of machine learning, semi-supervised learning (SSL) occupies the middle ground, between supervised learning (in which all training examples are labeled) and unsupervised learning (in which no label data are given). Interest in SSL has increased in recent years, particularly because of application domains in which unlabeled data are plentiful, such as images, text, and bioinformatics. This first comprehensive overview of SSL presents state-of-the-art algorithms, a taxonomy of the field, selected applications, benchmark experiments, and perspectives on ongoing and future research. Semi-Supervised Learning first presents the key assumptions and ideas underlying the field: smoothness, cluster or low-density separation, manifold structure, and transduction. The core of the book is the presentation of SSL methods, organized according to algorithmic strategies. After an examination of generative models, the book describes algorithms that implement the low-density separation assumption, graph-based methods, and algorithms that perform two-step learning. The book then discusses SSL applications and offers guidelines for SSL practitioners by analyzing the results of extensive benchmark experiments. Finally, the book looks at interesting directions for SSL research. The book closes with a discussion of the relationship between semi-supervised learning and transduction. Adaptive Computation and Machine Learning series

/pdf/semi-supervised-learning-scg1exixez.pdf

Semi-Supervised Learning

(2002). Modelling Extremal Events for Insurance and Finance. Journal of the American Statistical Association: Vol. 97, No. 457, pp. 360-360.

Modelling Extremal Events for Insurance and Finance

Convergence to the Poisson distribution, for the number of occurrences of dependent events, can often be established by computing only first and second moments, but not higher ones. This remarkable result is due to Chen (1975). The method also provides an upper bound on the total variation distance to the Poisson distribution, and succeeds in cases where third and higher moments blow up. This paper presents Chen's results in a form that is easy to use and gives a multivariable extension, which gives an upper bound on the total variation distance between a sequence of dependent indicator functions and a Poisson process with the same intensity. A corollary of this is an upper bound on the total variation distance between a sequence of dependent indicator variables and the process having the same marginals but independent coordinates.

/pdf/two-moments-suffice-for-poisson-approximations-the-chen-2irpxe1jnb.pdf

Two Moments Suffice for Poisson Approximations: The Chen-Stein Method

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.

/pdf/normal-approximation-by-stein-s-method-318fb5e2sc.pdf

Normal Approximation by Stein's Method

The Chen-Stein method of Poisson approximation is a powerful tool for computing an error bound when approximating probabilities using the Poisson distribution. In many cases, this bound may be given in terms of first and second moments alone. We present a background of the method and state some fundamental Poisson approximation theorems. The body of this paper is an illustration, through varied examples, of the wide applicability and utility of the Chen-Stein method. These examples include birthday coincidences, head runs in coin tosses, random graphs, maxima of normal variates and random permutations and mappings. We conclude with an application to molecular biology. The variety of examples presented here does not exhaust the range of possible applications of the Chen-Stein method.

https://projecteuclid.org/download/pdf_1/euclid.ss/1177012015

Poisson Approximation and the Chen-Stein Method

The Chen-Stein method of Poisson approximation is a powerful tool for computing an error bound when approximating probabilities using the Poisson distribution. In many cases, this bound may be given in terms of first and second moments alone. We present a background of the method and state some fundamental Poisson approximation theorems. The body of this paper is an illustration, through varied examples, of the wide applica- bility and utility of the Chen-Stein method. These examples include birth- day coincidences, head runs in coin tosses, random graphs, maxima of normal variates and random permutations and mappings. We conclude with an application to molecular biology. The variety of examples presented here does not exhaust the range of possible applications of the Chen-Stein method.

https://www.jstor.org/stable/pdfplus/2245366.pdf

Poisson Approximation and the Chen-Stein ethod

A variant of the case-cohort design is proposed for the situation in which a correlate of the exposure (or prognostic factor) of interest is available for all cohort members, and exposure information is to be collected for a case-cohort sample. The cohort is stratified according to the correlate, and the subcohort is selected by stratified random sampling. A number of possible methods for the analysis of such exposure stratified case-cohort samples are presented, some of their statistical properties developed, and approximate relative efficiency and optimal allocation to the strata discussed. The methods are compared to each other, and to randomly sampled case-cohort studies, in a limited computer simulation study. We found that all of the proposed analysis methods performed well and were more efficient than a randomly sampled case-cohort study.

Larry Goldstein

Papers

Two Moments Suffice for Poisson Approximations: The Chen-Stein Method

Normal Approximation by Stein's Method

Poisson Approximation and the Chen-Stein Method

Poisson Approximation and the Chen-Stein ethod

Exposure stratified case-cohort designs.