Convergence in distribution off by one correction?
$begingroup$
Suppose that $mu > 0$ is given. I know that $mathsf{Ber}(n, mu/n)to mathsf{Poi}(mu)$ in distribution. Is it also true that $mathsf{Ber}(n-1, mu/n) to mathsf{Poi}(mu)$? If possible, I'd like to show this using the simpler characterization of distributional convergence (ie., not the version which says something about integration of bounded continuous functions). One idea I had was to show that the total variation distance between $mathsf{Ber}(n, mu/n)$ and $mathsf{Ber}(n-1, mu/n)$ goes to zero, which would be sufficient by the triangle inequality, but I'm having trouble getting the details to work out.
probability-theory
$endgroup$
add a comment |
$begingroup$
Suppose that $mu > 0$ is given. I know that $mathsf{Ber}(n, mu/n)to mathsf{Poi}(mu)$ in distribution. Is it also true that $mathsf{Ber}(n-1, mu/n) to mathsf{Poi}(mu)$? If possible, I'd like to show this using the simpler characterization of distributional convergence (ie., not the version which says something about integration of bounded continuous functions). One idea I had was to show that the total variation distance between $mathsf{Ber}(n, mu/n)$ and $mathsf{Ber}(n-1, mu/n)$ goes to zero, which would be sufficient by the triangle inequality, but I'm having trouble getting the details to work out.
probability-theory
$endgroup$
add a comment |
$begingroup$
Suppose that $mu > 0$ is given. I know that $mathsf{Ber}(n, mu/n)to mathsf{Poi}(mu)$ in distribution. Is it also true that $mathsf{Ber}(n-1, mu/n) to mathsf{Poi}(mu)$? If possible, I'd like to show this using the simpler characterization of distributional convergence (ie., not the version which says something about integration of bounded continuous functions). One idea I had was to show that the total variation distance between $mathsf{Ber}(n, mu/n)$ and $mathsf{Ber}(n-1, mu/n)$ goes to zero, which would be sufficient by the triangle inequality, but I'm having trouble getting the details to work out.
probability-theory
$endgroup$
Suppose that $mu > 0$ is given. I know that $mathsf{Ber}(n, mu/n)to mathsf{Poi}(mu)$ in distribution. Is it also true that $mathsf{Ber}(n-1, mu/n) to mathsf{Poi}(mu)$? If possible, I'd like to show this using the simpler characterization of distributional convergence (ie., not the version which says something about integration of bounded continuous functions). One idea I had was to show that the total variation distance between $mathsf{Ber}(n, mu/n)$ and $mathsf{Ber}(n-1, mu/n)$ goes to zero, which would be sufficient by the triangle inequality, but I'm having trouble getting the details to work out.
probability-theory
probability-theory
asked Dec 23 '18 at 12:22
Drew BradyDrew Brady
731315
731315
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Poisson Theorem says:
$forall n geq 1, X_{n,k}$ for $k=1...n,$ are independent random variables identically distributed as a $B(p_n)$ and $np_n longrightarrow lambda > 0$ for $n rightarrow infty$ and $p_n rightarrow 0$. If so, then:
$$ S_{n,n} = sum_{k=1}^{n}X_{n,k} overset L longrightarrow X = P(lambda) Longrightarrow B(n,p_n) simeq P(lambda)$$
If we change $n$ for $n-1$, the hypothesis $(n-1)p_{n-1}$ is $np_{n-1} - p_{n-1}$ and for $n rightarrow infty$ and $p_n rightarrow 0$ (so $p_{n-1} rightarrow 0)$, is $lambda - 0 = lambda$. So here we have the importance of limit to $infty$.
$endgroup$
$begingroup$
Yeah, that's pretty much what I needed, thanks!
$endgroup$
– Drew Brady
Dec 23 '18 at 13:22
add a comment |
$begingroup$
Let $X_nsim B(n-1,mu/n)$ and $Y_nsim B(n,mu/n)$; you want to show the TV distance between the laws of $X_n$ and $Y_n$ goes like $mu/nto0$. I think this is a good idea.
Here's one way to see why this is so.
Construct a coupling $Y_n=X_n+Z_n$, where $Z_nsim B(1,mu/n)$ is independent of $X_n$. Then the TV distance is bounded by $P(X_nne Y_n) =P(Z_n=1)=mu/n$. For given any set $A$, when conditioning on $Z_n$ you get (after a tiny bit of algebra) $$|P(X_nin A) - P(Y_nin A)|le frac mu n .$$
$endgroup$
$begingroup$
Yep, that makes sense. I figured there would be a correction term (i.e., something like your $Z_n$ to add to $X_n$ to make it equal to $Y_n$ in distribution; thanks for giving me a direction to go here!
$endgroup$
– Drew Brady
Dec 23 '18 at 19:32
add a comment |
Your Answer
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%2f3050301%2fconvergence-in-distribution-off-by-one-correction%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Poisson Theorem says:
$forall n geq 1, X_{n,k}$ for $k=1...n,$ are independent random variables identically distributed as a $B(p_n)$ and $np_n longrightarrow lambda > 0$ for $n rightarrow infty$ and $p_n rightarrow 0$. If so, then:
$$ S_{n,n} = sum_{k=1}^{n}X_{n,k} overset L longrightarrow X = P(lambda) Longrightarrow B(n,p_n) simeq P(lambda)$$
If we change $n$ for $n-1$, the hypothesis $(n-1)p_{n-1}$ is $np_{n-1} - p_{n-1}$ and for $n rightarrow infty$ and $p_n rightarrow 0$ (so $p_{n-1} rightarrow 0)$, is $lambda - 0 = lambda$. So here we have the importance of limit to $infty$.
$endgroup$
$begingroup$
Yeah, that's pretty much what I needed, thanks!
$endgroup$
– Drew Brady
Dec 23 '18 at 13:22
add a comment |
$begingroup$
Poisson Theorem says:
$forall n geq 1, X_{n,k}$ for $k=1...n,$ are independent random variables identically distributed as a $B(p_n)$ and $np_n longrightarrow lambda > 0$ for $n rightarrow infty$ and $p_n rightarrow 0$. If so, then:
$$ S_{n,n} = sum_{k=1}^{n}X_{n,k} overset L longrightarrow X = P(lambda) Longrightarrow B(n,p_n) simeq P(lambda)$$
If we change $n$ for $n-1$, the hypothesis $(n-1)p_{n-1}$ is $np_{n-1} - p_{n-1}$ and for $n rightarrow infty$ and $p_n rightarrow 0$ (so $p_{n-1} rightarrow 0)$, is $lambda - 0 = lambda$. So here we have the importance of limit to $infty$.
$endgroup$
$begingroup$
Yeah, that's pretty much what I needed, thanks!
$endgroup$
– Drew Brady
Dec 23 '18 at 13:22
add a comment |
$begingroup$
Poisson Theorem says:
$forall n geq 1, X_{n,k}$ for $k=1...n,$ are independent random variables identically distributed as a $B(p_n)$ and $np_n longrightarrow lambda > 0$ for $n rightarrow infty$ and $p_n rightarrow 0$. If so, then:
$$ S_{n,n} = sum_{k=1}^{n}X_{n,k} overset L longrightarrow X = P(lambda) Longrightarrow B(n,p_n) simeq P(lambda)$$
If we change $n$ for $n-1$, the hypothesis $(n-1)p_{n-1}$ is $np_{n-1} - p_{n-1}$ and for $n rightarrow infty$ and $p_n rightarrow 0$ (so $p_{n-1} rightarrow 0)$, is $lambda - 0 = lambda$. So here we have the importance of limit to $infty$.
$endgroup$
Poisson Theorem says:
$forall n geq 1, X_{n,k}$ for $k=1...n,$ are independent random variables identically distributed as a $B(p_n)$ and $np_n longrightarrow lambda > 0$ for $n rightarrow infty$ and $p_n rightarrow 0$. If so, then:
$$ S_{n,n} = sum_{k=1}^{n}X_{n,k} overset L longrightarrow X = P(lambda) Longrightarrow B(n,p_n) simeq P(lambda)$$
If we change $n$ for $n-1$, the hypothesis $(n-1)p_{n-1}$ is $np_{n-1} - p_{n-1}$ and for $n rightarrow infty$ and $p_n rightarrow 0$ (so $p_{n-1} rightarrow 0)$, is $lambda - 0 = lambda$. So here we have the importance of limit to $infty$.
edited Dec 23 '18 at 15:49
answered Dec 23 '18 at 13:00
Miguel AnguitaMiguel Anguita
485
485
$begingroup$
Yeah, that's pretty much what I needed, thanks!
$endgroup$
– Drew Brady
Dec 23 '18 at 13:22
add a comment |
$begingroup$
Yeah, that's pretty much what I needed, thanks!
$endgroup$
– Drew Brady
Dec 23 '18 at 13:22
$begingroup$
Yeah, that's pretty much what I needed, thanks!
$endgroup$
– Drew Brady
Dec 23 '18 at 13:22
$begingroup$
Yeah, that's pretty much what I needed, thanks!
$endgroup$
– Drew Brady
Dec 23 '18 at 13:22
add a comment |
$begingroup$
Let $X_nsim B(n-1,mu/n)$ and $Y_nsim B(n,mu/n)$; you want to show the TV distance between the laws of $X_n$ and $Y_n$ goes like $mu/nto0$. I think this is a good idea.
Here's one way to see why this is so.
Construct a coupling $Y_n=X_n+Z_n$, where $Z_nsim B(1,mu/n)$ is independent of $X_n$. Then the TV distance is bounded by $P(X_nne Y_n) =P(Z_n=1)=mu/n$. For given any set $A$, when conditioning on $Z_n$ you get (after a tiny bit of algebra) $$|P(X_nin A) - P(Y_nin A)|le frac mu n .$$
$endgroup$
$begingroup$
Yep, that makes sense. I figured there would be a correction term (i.e., something like your $Z_n$ to add to $X_n$ to make it equal to $Y_n$ in distribution; thanks for giving me a direction to go here!
$endgroup$
– Drew Brady
Dec 23 '18 at 19:32
add a comment |
$begingroup$
Let $X_nsim B(n-1,mu/n)$ and $Y_nsim B(n,mu/n)$; you want to show the TV distance between the laws of $X_n$ and $Y_n$ goes like $mu/nto0$. I think this is a good idea.
Here's one way to see why this is so.
Construct a coupling $Y_n=X_n+Z_n$, where $Z_nsim B(1,mu/n)$ is independent of $X_n$. Then the TV distance is bounded by $P(X_nne Y_n) =P(Z_n=1)=mu/n$. For given any set $A$, when conditioning on $Z_n$ you get (after a tiny bit of algebra) $$|P(X_nin A) - P(Y_nin A)|le frac mu n .$$
$endgroup$
$begingroup$
Yep, that makes sense. I figured there would be a correction term (i.e., something like your $Z_n$ to add to $X_n$ to make it equal to $Y_n$ in distribution; thanks for giving me a direction to go here!
$endgroup$
– Drew Brady
Dec 23 '18 at 19:32
add a comment |
$begingroup$
Let $X_nsim B(n-1,mu/n)$ and $Y_nsim B(n,mu/n)$; you want to show the TV distance between the laws of $X_n$ and $Y_n$ goes like $mu/nto0$. I think this is a good idea.
Here's one way to see why this is so.
Construct a coupling $Y_n=X_n+Z_n$, where $Z_nsim B(1,mu/n)$ is independent of $X_n$. Then the TV distance is bounded by $P(X_nne Y_n) =P(Z_n=1)=mu/n$. For given any set $A$, when conditioning on $Z_n$ you get (after a tiny bit of algebra) $$|P(X_nin A) - P(Y_nin A)|le frac mu n .$$
$endgroup$
Let $X_nsim B(n-1,mu/n)$ and $Y_nsim B(n,mu/n)$; you want to show the TV distance between the laws of $X_n$ and $Y_n$ goes like $mu/nto0$. I think this is a good idea.
Here's one way to see why this is so.
Construct a coupling $Y_n=X_n+Z_n$, where $Z_nsim B(1,mu/n)$ is independent of $X_n$. Then the TV distance is bounded by $P(X_nne Y_n) =P(Z_n=1)=mu/n$. For given any set $A$, when conditioning on $Z_n$ you get (after a tiny bit of algebra) $$|P(X_nin A) - P(Y_nin A)|le frac mu n .$$
answered Dec 23 '18 at 13:25
kimchi loverkimchi lover
11.9k31229
11.9k31229
$begingroup$
Yep, that makes sense. I figured there would be a correction term (i.e., something like your $Z_n$ to add to $X_n$ to make it equal to $Y_n$ in distribution; thanks for giving me a direction to go here!
$endgroup$
– Drew Brady
Dec 23 '18 at 19:32
add a comment |
$begingroup$
Yep, that makes sense. I figured there would be a correction term (i.e., something like your $Z_n$ to add to $X_n$ to make it equal to $Y_n$ in distribution; thanks for giving me a direction to go here!
$endgroup$
– Drew Brady
Dec 23 '18 at 19:32
$begingroup$
Yep, that makes sense. I figured there would be a correction term (i.e., something like your $Z_n$ to add to $X_n$ to make it equal to $Y_n$ in distribution; thanks for giving me a direction to go here!
$endgroup$
– Drew Brady
Dec 23 '18 at 19:32
$begingroup$
Yep, that makes sense. I figured there would be a correction term (i.e., something like your $Z_n$ to add to $X_n$ to make it equal to $Y_n$ in distribution; thanks for giving me a direction to go here!
$endgroup$
– Drew Brady
Dec 23 '18 at 19:32
add a comment |
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.
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%2f3050301%2fconvergence-in-distribution-off-by-one-correction%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