Approximate Computation of Expectations

Front Cover
IMS, 1986 - Mathematics - 164 pages
1 Review
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Common terms and phrases

Popular passages

Page 164 - On the rate of convergence in the central limit theorem for weakly dependent random variables.
Page 6 - We are grateful to the National Science Foundation for its support of this work through grant CHE-7606099.
Page 37 - Xj,J = l,2,... be independent identically distributed random variables with mean 0 and variance 1 and let T^ =п1/2(Х...
Page 34 - Eqns. (1) and (2), we define the recombination current fluctuation to be the sum of the last two terms on the right hand side, i, (t) = - e dn(tVdt = en(t) / T - efn(t).
Page 5 - One reason for this is that such random variables may be used to approximate the distribution of the number of successes in a large number of...
Page 51 - These include the number of ones in the binary expansion of a random integer, Latin rectangles, random allocations, and the number of isolated trees in a random graph.
Page 164 - YAMAMOTO, K. (1951). On the asymptotic number of Latin rectangles. Japan J. Math. 21, 113-119.
Page 133 - N*, is a random variable whose distribution is the same as the conditional distribution of...
Page 29 - I shall give a proof of this lemma although it is the well-known fact that the zeroth reduced homology group of a connected augmented simplical complex is 0.
Page 128 - Two such sequences determine the same cycle if and only if one is a cyclic permutation of the other.

References to this book

Random Geometric Graphs
Mathew Penrose
No preview available - 2003
All Book Search results »

Bibliographic information