Probability of having m groups of at least 2 empty consecutive cells by putting k balls in n bins
Suppose k balls are placed uniformly at random in n cells, each one with probability 1/n. Let's call "r-block" a group of at least r consecutive cells.
I would like to know if it's possible to compute the probability of having m empty 2-block.
I know the probability of having exactly t empty cells is $$P(n,k,t)=dfrac{binom{n}{t}S(k,n-t)(n-t)!}{n^k}$$ where $S(a,b)$ represents the Stirling's number of the second kind, but in the case of interest it seems to me too difficult to compute the number of possible configurations, as I did to derive the previous formula.
I've also found that $$(n-r)binom{n-r-1}{t-r}+binom{n-r}{t-r}$$ expresses the ways of choosing t out of n numbers with at least r consecutive numbers. If my cells are numbered ${1,2,dots,n}$ and a list of numbers represents the empty ones, using that formula I obtain the total occurrencies of r-blocks that are empty when the total number of empty cells is t.
The problem is in this way I only have the total number of r-blocks for a given t, which could be used in principle to obtain the probability of finding at least 1 empty r-block, but not exactly m empty r-block.
probability combinatorics balls-in-bins
add a comment |
Suppose k balls are placed uniformly at random in n cells, each one with probability 1/n. Let's call "r-block" a group of at least r consecutive cells.
I would like to know if it's possible to compute the probability of having m empty 2-block.
I know the probability of having exactly t empty cells is $$P(n,k,t)=dfrac{binom{n}{t}S(k,n-t)(n-t)!}{n^k}$$ where $S(a,b)$ represents the Stirling's number of the second kind, but in the case of interest it seems to me too difficult to compute the number of possible configurations, as I did to derive the previous formula.
I've also found that $$(n-r)binom{n-r-1}{t-r}+binom{n-r}{t-r}$$ expresses the ways of choosing t out of n numbers with at least r consecutive numbers. If my cells are numbered ${1,2,dots,n}$ and a list of numbers represents the empty ones, using that formula I obtain the total occurrencies of r-blocks that are empty when the total number of empty cells is t.
The problem is in this way I only have the total number of r-blocks for a given t, which could be used in principle to obtain the probability of finding at least 1 empty r-block, but not exactly m empty r-block.
probability combinatorics balls-in-bins
add a comment |
Suppose k balls are placed uniformly at random in n cells, each one with probability 1/n. Let's call "r-block" a group of at least r consecutive cells.
I would like to know if it's possible to compute the probability of having m empty 2-block.
I know the probability of having exactly t empty cells is $$P(n,k,t)=dfrac{binom{n}{t}S(k,n-t)(n-t)!}{n^k}$$ where $S(a,b)$ represents the Stirling's number of the second kind, but in the case of interest it seems to me too difficult to compute the number of possible configurations, as I did to derive the previous formula.
I've also found that $$(n-r)binom{n-r-1}{t-r}+binom{n-r}{t-r}$$ expresses the ways of choosing t out of n numbers with at least r consecutive numbers. If my cells are numbered ${1,2,dots,n}$ and a list of numbers represents the empty ones, using that formula I obtain the total occurrencies of r-blocks that are empty when the total number of empty cells is t.
The problem is in this way I only have the total number of r-blocks for a given t, which could be used in principle to obtain the probability of finding at least 1 empty r-block, but not exactly m empty r-block.
probability combinatorics balls-in-bins
Suppose k balls are placed uniformly at random in n cells, each one with probability 1/n. Let's call "r-block" a group of at least r consecutive cells.
I would like to know if it's possible to compute the probability of having m empty 2-block.
I know the probability of having exactly t empty cells is $$P(n,k,t)=dfrac{binom{n}{t}S(k,n-t)(n-t)!}{n^k}$$ where $S(a,b)$ represents the Stirling's number of the second kind, but in the case of interest it seems to me too difficult to compute the number of possible configurations, as I did to derive the previous formula.
I've also found that $$(n-r)binom{n-r-1}{t-r}+binom{n-r}{t-r}$$ expresses the ways of choosing t out of n numbers with at least r consecutive numbers. If my cells are numbered ${1,2,dots,n}$ and a list of numbers represents the empty ones, using that formula I obtain the total occurrencies of r-blocks that are empty when the total number of empty cells is t.
The problem is in this way I only have the total number of r-blocks for a given t, which could be used in principle to obtain the probability of finding at least 1 empty r-block, but not exactly m empty r-block.
probability combinatorics balls-in-bins
probability combinatorics balls-in-bins
edited Nov 21 '18 at 19:44
asked Nov 19 '18 at 23:39
ARWarrior
64
64
add a comment |
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005698%2fprobability-of-having-m-groups-of-at-least-2-empty-consecutive-cells-by-putting%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3005698%2fprobability-of-having-m-groups-of-at-least-2-empty-consecutive-cells-by-putting%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown