deb
Reputation
Top tag
Next privilege 75 Rep.
Set bounties
1 9
Impact
~980 people reached

• 0 posts edited

# 37 Actions

 Apr 11 comment Is there a way to update the inverse of a sum of two matrices following a rescaling of one of them? You can use the following : $(A + gB)^{-1} = ((AB^{-1} + gI)B)^{-1} = B^{-1} (AB^{-1} + gI)^{-1}$ Apr 11 awarded Enthusiast Mar 27 comment generalized Bonferroni inequalities? Write down the formula for $P(\cup_{i=1}^n A_i)$ using the inclusion-exclusion principle. Now if you truncate the sum after an even (odd) number of terms you get a lower (upper) bound. Mar 27 comment positive definite of a matrix(diagonal decay) Mar 21 awarded Commentator Mar 21 comment Chernoff vs Berry-Esseen @Did Thanks. Updated now! Mar 21 revised Chernoff vs Berry-Esseen added 683 characters in body Mar 21 revised Chernoff vs Berry-Esseen added 683 characters in body Mar 21 revised Chernoff vs Berry-Esseen added 683 characters in body Mar 21 revised Chernoff vs Berry-Esseen added 683 characters in body Mar 20 comment Chernoff vs Berry-Esseen Could you please explain where I am wrong? Is your concern the following : $\lim_{n\rightarrow \infty} P[(S_n - n\mu)/\sqrt{n} \leq z] = \Phi(z/\sigma)$ only when $z$ is a constant and does not vary with $n$. Mar 19 revised Chernoff vs Berry-Esseen edited tags Mar 18 revised Chernoff vs Berry-Esseen added 1 character in body Mar 16 answered Convergence in Distribution implies convergences almost surely Mar 13 awarded Editor Mar 13 comment Prove a sum of fractions less than a value sum of first five terms < 1, sum of last ten terms < 1 Mar 13 comment Markov Chain Snakes and Ladders Let $p_s(t)$ be the prob you reach 9 in at most t steps from s. Then $p_3(4) = 0.5 p_4(3) + 0.5 p_5(3) = ...$ Mar 13 comment Markov Chain Snakes and Ladders If you say so, the matrix P is correct except (8,2) should be 1 not (8,1) Mar 13 comment Markov Chain Snakes and Ladders Do you consider moving from 4 to 7 or 8 to 2 as a step? I would think that the number of steps should be equal to the number of tosses. Mar 11 awarded Curious