Hi Peter, H Berwin,
thanks a lot for your clarifications, it makes more sense now. But having
our input and thinking a little bit more about the problem, I realized that
I am simply interested in the pdf p(y) that y *number* of entities (which
ones is irrelevant) in N are are *not* drawn after the
G'day Rainer,
On Sun, 26 Sep 2010 10:29:08 +0200
Rainer M Krug wrote:
> I realized that I am simply interested in the pdf p(y) that y
> *number* of entities (which ones is irrelevant) in N are are *not*
> drawn after the sampling process has been completed. Even simpler (I
> guess), in a first s
On 09/26/2010 10:29 AM, Rainer M Krug wrote:
> Hi Peter, H Berwin,
>
> thanks a lot for your clarifications, it makes more sense now. But
> having our input and thinking a little bit more about the problem, I
> realized that I am simply interested in the pdf p(y) that y *number* of
> entities (whi
On 09/25/2010 04:24 PM, Rainer M Krug wrote:
> Hi
>
> This is OT, but I need it for my simulation in R.
>
> I have a special case for sampling with replacement: instead of sampling
> once and replacing it immediately, I sample n times, and then replace all n
> items.
>
>
> So:
>
> N entities
>
G'day Rainer,
On Sat, 25 Sep 2010 16:24:17 +0200
Rainer M Krug wrote:
> This is OT, but I need it for my simulation in R.
>
> I have a special case for sampling with replacement: instead of
> sampling once and replacing it immediately, I sample n times, and
> then replace all n items.
>
>
> S
Hi
This is OT, but I need it for my simulation in R.
I have a special case for sampling with replacement: instead of sampling
once and replacing it immediately, I sample n times, and then replace all n
items.
So:
N entities
x samples with replacement
each sample consists of n sub-samples WITHO
6 matches
Mail list logo
