Timeline for How to compute means μ1 and μ2 knowing sum of Skellam distributions f(k;μ1,μ2) and sum μ1+μ2, where k is from 2 to n?
Current License: CC BY-SA 4.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 28, 2020 at 17:24 | comment | added | Bjørn Kjos-Hanssen | Rather than paying, you can try using WolframAlpha Open Code, which has Bessel function support: open.wolframcloud.com/env/… | |
Oct 27, 2019 at 21:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
Jun 29, 2019 at 20:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
May 30, 2019 at 19:21 | answer | added | user64494 | timeline score: 1 | |
May 30, 2019 at 18:57 | comment | added | Sergei Dvindenko | @user64494 yes, we know these concrete parameters. Can we compute, for example, if n = 5, μ = 3.18 and a = 0.22? This decision for concrete numbers will be valued for me. What CASes are u talking about? | |
May 30, 2019 at 16:27 | comment | added | user64494 | I think it can be done numerically by CASes in the case of concrete $n, \mu$ and $a$ only. | |
May 30, 2019 at 16:05 | comment | added | Sergei Dvindenko | @user64494 yes, you are right. I just wrote a common formula, as this does not matter for this case. | |
May 30, 2019 at 15:55 | comment | added | user64494 | Why $|k|$ in $I_{|k|}(2\sqrt{\mu1\mu2})$ if you sum up for $k$ from 2 to $n$? | |
May 30, 2019 at 14:20 | review | Close votes | |||
May 31, 2019 at 17:16 | |||||
May 30, 2019 at 14:00 | review | First posts | |||
May 30, 2019 at 14:03 | |||||
May 30, 2019 at 13:56 | history | asked | Sergei Dvindenko | CC BY-SA 4.0 |