Timeline for Minimum of Poissons
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2018 at 15:26 | vote | accept | Conner DiPaolo | ||
| Feb 5, 2018 at 15:26 | |||||
| Jan 21, 2018 at 16:31 | history | tweeted | twitter.com/StackStats/status/955115708169498624 | ||
| Jan 21, 2018 at 11:41 | comment | added | Conner DiPaolo | @Xi'an nice catch that's definitely cleaner | |
| Jan 21, 2018 at 10:01 | comment | added | Xi'an | You do not even need Jensen: $\min X_i\le X_i$ for all $i$'s, hence $\mathbb{E}[\min_i X_i] \leq\mathbb{E}[X_i]$ for all $i$'s. | |
| Jan 21, 2018 at 9:56 | history | edited | Conner DiPaolo | CC BY-SA 3.0 |
typo
|
| Jan 21, 2018 at 9:55 | answer | added | Conner DiPaolo | timeline score: 0 | |
| Jan 21, 2018 at 9:32 | history | edited | Conner DiPaolo | CC BY-SA 3.0 |
typo fix and add iid example.
|
| Jan 21, 2018 at 6:41 | comment | added | Conner DiPaolo | @Taylor I’m quite sure: the minimum of a collection of linear functionals over $\mathbb{R}^n$ is concave (draw a picture to check). Denote $X=(X_1,\ldots,X_n)\in\mathbb{R}^n$. Then $\min X_i = \min \langle X,e_i\rangle$ is a minimum of linear functionals and hence concave, so Jensen applies. | |
| Jan 21, 2018 at 5:55 | comment | added | Taylor | are you sure you can use Jensen's inequality here? | |
| Jan 21, 2018 at 3:46 | history | edited | Conner DiPaolo | CC BY-SA 3.0 |
clarity
|
| Jan 20, 2018 at 18:02 | comment | added | Conner DiPaolo | @whuber ah thanks. I meant that $X_i$ are effectively i.i.d because for large enough $\gamma$, the probability that $Y = X_n$ is low. | |
| Jan 20, 2018 at 18:01 | history | edited | Conner DiPaolo | CC BY-SA 3.0 |
typo
|
| Jan 20, 2018 at 17:41 | comment | added | whuber♦ | What do you mean by "assume $X_i$" in the last sentence? Are some words missing? | |
| Jan 20, 2018 at 17:04 | review | First posts | |||
| Jan 20, 2018 at 17:54 | |||||
| Jan 20, 2018 at 17:01 | history | asked | Conner DiPaolo | CC BY-SA 3.0 |