bio | website | |
---|---|---|
location | UT Austin | |
age | ||
visits | member for | 5 years, 7 months |
seen | Sep 17 '14 at 14:18 | |
stats | profile views | 193 |
Jul 24 |
revised |
question on sigma-fields
added 109 characters in body |
May 27 |
comment |
What are the most misleading alternate definitions in taught mathematics?
Resolve it how, short of a serious digression into conditional expectation? |
Apr 6 |
awarded | Editor |
Apr 6 |
revised |
Can you explain a step in an expectation maximization algorithm in a Nature article?
added 43 characters in body |
Apr 6 |
revised |
Can you explain a step in an expectation maximization algorithm in a Nature article?
added 409 characters in body; deleted 9 characters in body |
Apr 6 |
answered | Can you explain a step in an expectation maximization algorithm in a Nature article? |
Jan 28 |
comment |
How many trial picks expectedly sufficient to cover a sample space?
The r=1 case is just the coupon collector's problem - en.wikipedia.org/wiki/Coupon_collector%27s_problem. Look at the 'calculating the expectation' section of the linked page for a much simpler and more elegant way of getting your result. |
Jan 11 |
comment |
question on sigma-fields
Don't we need the sequence Y_n to converge to Y pointwise, not just almost surely, since we want Y = f(X) pointwise, not just almost surely? Of course, this isn't a problem for the proof, since such a sequence exists. Also, a way to avoid the distinction between when lim_n f_n exists and when it doesn't is to just take f = limsup_n f_n. |
Dec 11 |
awarded | Supporter |
Dec 4 |
awarded | Student |
Nov 21 |
awarded | Teacher |
Nov 20 |
answered | question on sigma-fields |
Nov 20 |
asked | order statistics for components of a random unit vector |