bio | website | math.ubc.ca/~angel |
---|---|---|
location | ||
age | ||
visits | member for | 4 years, 11 months |
seen | Feb 4 at 13:54 | |
stats | profile views | 686 |
Feb
4 |
comment |
Lower bound for the $p$-th absolute moment of a sum of random variables
Is it true that $\mathbb{E} |S_n|^p \geq c n^{p/2-1} \sum \mathbb{E} |X_i|^p$? |
Feb
4 |
comment |
Question regarding a theorem of Erdos and Renyi on $B_2(g)$ sequence
That depends on your definition of $A\ll B$. If it mean $A<cB$, then as Noam said, this is true. If it means $A/B\to 0$ then the answer is less clear. For example, if we change the problem to count solutions of $s_1+2s_2=n$ then it is easy to get $S(n) \ge n^{1/2}$, even with $g=1$. |
Sep
21 |
awarded | Yearling |
Jul
22 |
awarded | Revival |
Jun
10 |
answered | First Collision Time for k Random Walkers on a Torus |
Apr
2 |
revised |
probability of non-existence of a sum subset
added 184 characters in body |
Apr
1 |
answered | probability of non-existence of a sum subset |
Apr
1 |
answered | conditional expectation under convex combinaison of probability measures(II) |
Mar
25 |
answered | Are gaussians with different moments far in total variation distance? |
Mar
25 |
comment |
Sampling from a Convex Body with Many Extremal Points
Not nearly as fast as you ask for, but you can approximate the convex hull by the hull of a smaller, possibly random subset of the points. $e^{cn}$ should suffice for a good approximation. |
Mar
14 |
answered | Nice examples/arguments that illustrating the coupling method in probability theory |
Mar
14 |
comment |
Are gaussians with different moments far in total variation distance?
Is this a homework problem? |
Jan
21 |
comment |
An intutive reason why a “distance” metric may be a poor one for a procedure where we attempt to modify a string (mutating 0 OR 1 bits)
It is not clear what exactly you are trying to achieve. Are you trying to minimize the expected time to hit a target? what options other than 1 and 2 do you have? |
Nov
1 |
answered | Logarithmic mean |
Sep
27 |
answered | Running the Greene-Nijenhuis Algorithm Backwards |
Sep
21 |
awarded | Yearling |
Jan
19 |
answered | What is the expected value for this |
Dec
5 |
revised |
Manhattan distance vs. absorption time on an unbounded integer lattice
added some details. |
Dec
4 |
answered | Manhattan distance vs. absorption time on an unbounded integer lattice |
Dec
3 |
answered | distinguishing random orthogonal matrix from Gaussian random matrix |