Timeline for Error bound for MonteCarlo estimate of elements in Gram-Matrix
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12 at 19:38 | vote | accept | Jjj | ||
| Oct 11 at 1:27 | history | edited | Michael Hardy | CC BY-SA 4.0 |
deleted 12 characters in body
|
| Oct 9 at 15:35 | answer | added | Iosif Pinelis | timeline score: 2 | |
| Oct 9 at 13:08 | history | edited | Jjj | CC BY-SA 4.0 |
Made the question more concrete.
|
| Oct 9 at 12:59 | comment | added | Jjj | Hi! Sorry about being to vague. But I would like to show that the given bound holds with at least a probability $p$, where the expression for $p$ depends on $N$ and possibly $n$. A desirable expression would be something like $p\sim 1-exp(-cN)$ so that $p$ goes to $0$ fast with N. I don't know if that's possible to show, but Im interested in that kind of results. | |
| Oct 9 at 12:42 | comment | added | Iosif Pinelis | What do you mean, precisely, by " high probability" here? | |
| Oct 9 at 12:23 | history | asked | Jjj | CC BY-SA 4.0 |