Convergence of row superposition of null array to Poisson point process
$begingroup$
Background: The limit of superposition of infinite number of independent point processes is a Poisson process under certain conditions. The conditions for the limit process to exist and be Poisson is given in Theorem 11.2.V in "An Introduction to the Theory of Point Processes. Vol 2 - D.J. Daley and D. Vere-Jones". The setting is a triangular array of point processes ${N_{ni}: i=1,...,m_n; n = 1,2,3,...}$ with $m_n rightarrow infty$ as $nrightarrow infty$. The point processes in each row are independent and we consider their superposition $N_n = sum_{i=1}^{m_n} N_{ni}$. This triangular array is called uniformly asymptotically null (u.a.n.) if $$lim_{nrightarrow infty} sup_{i} ;mathcal{P}[N_{ni}(A)>0] = 0$$ for a measurable set $A$ in the space on which the point process is defined. For the limit process $N_n$ to be a Poisson process, the theorem imposes two conditions on u.a.n. array. These are $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 2] = 0$$ and $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 1] = mu(A),$$ where $mu$ is some measure. If these two conditions hold for a u.a.n. array, then $lim_{nrightarrow infty} N_n$ is a Poisson process with intensity $mu$.
Question: Consider an u.a.n. array of Poisson point processes on $mathbb{R}$ where $N_{ni}$ is Poisson process of rate $lambda / n$ for $i = 1,...,n$ (here $m_n = n$). Superposition of each row ($N_n = sum_i N_{ni}$) is a Poisson process of rate $lambda$. Hence, the limit process is also a Poisson process of rate $lambda$. This is straightforward using the fact that superposition of independent Poisson process is a Poisson process with rate equal to sum of the rate of component Poisson processes.
Now, I want to establish the same result using the above theorem. We have $mathcal{P}[N_{ni}(A) geq 1] = frac{lambda}{n} mathcal{l}(A) + o(mathcal{l}(A))$ where $mathcal{l}$ is the lebesgue measure. The second condition in the theorem becomes $$ lim_{nrightarrow infty} sum_{i=1}^n ;mathcal{P}[N_{ni}(A) geq 1] = lim_{nrightarrow infty} sum_{i=1}^n left( frac{lambda}{n}mathcal{l}(A) + o(mathcal{l}(A))right) = lambda mathcal{l}(A) + lim_{nrightarrow infty} n, o(mathcal{l}(A)).$$ The term $lambda mathcal{l}(A)$ is exactly what is needed. But, how does it follow that $lim_{nrightarrow infty} n, o(mathcal{l}(A)) = 0 $? As far as I can see, there is no dependence on $n$ in $o(mathcal{l}(A))$.
Alternatively, for this specific case of Poisson processes, the term $mathcal{P},[N_{ni}(A) geq 1]$ can be written explicitly since $N_{ni}(A)$ is Poisson random variable with the mean $frac{lambda}{n} mathcal{l}(A)$. I have verified that writing each term this way, the above limit is in fact $lambda mathcal{l}(A)$. But, this is not what I am looking for. I feel there must be a way to handle $lim_{nrightarrow infty} n o(mathcal{l}(A))$. Expanding $mathcal{P},[N_{ni}(A) geq 1]$ explicitly gives hint that the $o$ term is actually $oleft(frac{mathcal{l}(A)}{n}right)$. But, I don't see how that happens in general.
I will be grateful for any hint/solution/explanation.
probability-limit-theorems point-processes
$endgroup$
add a comment |
$begingroup$
Background: The limit of superposition of infinite number of independent point processes is a Poisson process under certain conditions. The conditions for the limit process to exist and be Poisson is given in Theorem 11.2.V in "An Introduction to the Theory of Point Processes. Vol 2 - D.J. Daley and D. Vere-Jones". The setting is a triangular array of point processes ${N_{ni}: i=1,...,m_n; n = 1,2,3,...}$ with $m_n rightarrow infty$ as $nrightarrow infty$. The point processes in each row are independent and we consider their superposition $N_n = sum_{i=1}^{m_n} N_{ni}$. This triangular array is called uniformly asymptotically null (u.a.n.) if $$lim_{nrightarrow infty} sup_{i} ;mathcal{P}[N_{ni}(A)>0] = 0$$ for a measurable set $A$ in the space on which the point process is defined. For the limit process $N_n$ to be a Poisson process, the theorem imposes two conditions on u.a.n. array. These are $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 2] = 0$$ and $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 1] = mu(A),$$ where $mu$ is some measure. If these two conditions hold for a u.a.n. array, then $lim_{nrightarrow infty} N_n$ is a Poisson process with intensity $mu$.
Question: Consider an u.a.n. array of Poisson point processes on $mathbb{R}$ where $N_{ni}$ is Poisson process of rate $lambda / n$ for $i = 1,...,n$ (here $m_n = n$). Superposition of each row ($N_n = sum_i N_{ni}$) is a Poisson process of rate $lambda$. Hence, the limit process is also a Poisson process of rate $lambda$. This is straightforward using the fact that superposition of independent Poisson process is a Poisson process with rate equal to sum of the rate of component Poisson processes.
Now, I want to establish the same result using the above theorem. We have $mathcal{P}[N_{ni}(A) geq 1] = frac{lambda}{n} mathcal{l}(A) + o(mathcal{l}(A))$ where $mathcal{l}$ is the lebesgue measure. The second condition in the theorem becomes $$ lim_{nrightarrow infty} sum_{i=1}^n ;mathcal{P}[N_{ni}(A) geq 1] = lim_{nrightarrow infty} sum_{i=1}^n left( frac{lambda}{n}mathcal{l}(A) + o(mathcal{l}(A))right) = lambda mathcal{l}(A) + lim_{nrightarrow infty} n, o(mathcal{l}(A)).$$ The term $lambda mathcal{l}(A)$ is exactly what is needed. But, how does it follow that $lim_{nrightarrow infty} n, o(mathcal{l}(A)) = 0 $? As far as I can see, there is no dependence on $n$ in $o(mathcal{l}(A))$.
Alternatively, for this specific case of Poisson processes, the term $mathcal{P},[N_{ni}(A) geq 1]$ can be written explicitly since $N_{ni}(A)$ is Poisson random variable with the mean $frac{lambda}{n} mathcal{l}(A)$. I have verified that writing each term this way, the above limit is in fact $lambda mathcal{l}(A)$. But, this is not what I am looking for. I feel there must be a way to handle $lim_{nrightarrow infty} n o(mathcal{l}(A))$. Expanding $mathcal{P},[N_{ni}(A) geq 1]$ explicitly gives hint that the $o$ term is actually $oleft(frac{mathcal{l}(A)}{n}right)$. But, I don't see how that happens in general.
I will be grateful for any hint/solution/explanation.
probability-limit-theorems point-processes
$endgroup$
add a comment |
$begingroup$
Background: The limit of superposition of infinite number of independent point processes is a Poisson process under certain conditions. The conditions for the limit process to exist and be Poisson is given in Theorem 11.2.V in "An Introduction to the Theory of Point Processes. Vol 2 - D.J. Daley and D. Vere-Jones". The setting is a triangular array of point processes ${N_{ni}: i=1,...,m_n; n = 1,2,3,...}$ with $m_n rightarrow infty$ as $nrightarrow infty$. The point processes in each row are independent and we consider their superposition $N_n = sum_{i=1}^{m_n} N_{ni}$. This triangular array is called uniformly asymptotically null (u.a.n.) if $$lim_{nrightarrow infty} sup_{i} ;mathcal{P}[N_{ni}(A)>0] = 0$$ for a measurable set $A$ in the space on which the point process is defined. For the limit process $N_n$ to be a Poisson process, the theorem imposes two conditions on u.a.n. array. These are $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 2] = 0$$ and $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 1] = mu(A),$$ where $mu$ is some measure. If these two conditions hold for a u.a.n. array, then $lim_{nrightarrow infty} N_n$ is a Poisson process with intensity $mu$.
Question: Consider an u.a.n. array of Poisson point processes on $mathbb{R}$ where $N_{ni}$ is Poisson process of rate $lambda / n$ for $i = 1,...,n$ (here $m_n = n$). Superposition of each row ($N_n = sum_i N_{ni}$) is a Poisson process of rate $lambda$. Hence, the limit process is also a Poisson process of rate $lambda$. This is straightforward using the fact that superposition of independent Poisson process is a Poisson process with rate equal to sum of the rate of component Poisson processes.
Now, I want to establish the same result using the above theorem. We have $mathcal{P}[N_{ni}(A) geq 1] = frac{lambda}{n} mathcal{l}(A) + o(mathcal{l}(A))$ where $mathcal{l}$ is the lebesgue measure. The second condition in the theorem becomes $$ lim_{nrightarrow infty} sum_{i=1}^n ;mathcal{P}[N_{ni}(A) geq 1] = lim_{nrightarrow infty} sum_{i=1}^n left( frac{lambda}{n}mathcal{l}(A) + o(mathcal{l}(A))right) = lambda mathcal{l}(A) + lim_{nrightarrow infty} n, o(mathcal{l}(A)).$$ The term $lambda mathcal{l}(A)$ is exactly what is needed. But, how does it follow that $lim_{nrightarrow infty} n, o(mathcal{l}(A)) = 0 $? As far as I can see, there is no dependence on $n$ in $o(mathcal{l}(A))$.
Alternatively, for this specific case of Poisson processes, the term $mathcal{P},[N_{ni}(A) geq 1]$ can be written explicitly since $N_{ni}(A)$ is Poisson random variable with the mean $frac{lambda}{n} mathcal{l}(A)$. I have verified that writing each term this way, the above limit is in fact $lambda mathcal{l}(A)$. But, this is not what I am looking for. I feel there must be a way to handle $lim_{nrightarrow infty} n o(mathcal{l}(A))$. Expanding $mathcal{P},[N_{ni}(A) geq 1]$ explicitly gives hint that the $o$ term is actually $oleft(frac{mathcal{l}(A)}{n}right)$. But, I don't see how that happens in general.
I will be grateful for any hint/solution/explanation.
probability-limit-theorems point-processes
$endgroup$
Background: The limit of superposition of infinite number of independent point processes is a Poisson process under certain conditions. The conditions for the limit process to exist and be Poisson is given in Theorem 11.2.V in "An Introduction to the Theory of Point Processes. Vol 2 - D.J. Daley and D. Vere-Jones". The setting is a triangular array of point processes ${N_{ni}: i=1,...,m_n; n = 1,2,3,...}$ with $m_n rightarrow infty$ as $nrightarrow infty$. The point processes in each row are independent and we consider their superposition $N_n = sum_{i=1}^{m_n} N_{ni}$. This triangular array is called uniformly asymptotically null (u.a.n.) if $$lim_{nrightarrow infty} sup_{i} ;mathcal{P}[N_{ni}(A)>0] = 0$$ for a measurable set $A$ in the space on which the point process is defined. For the limit process $N_n$ to be a Poisson process, the theorem imposes two conditions on u.a.n. array. These are $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 2] = 0$$ and $$lim_{nrightarrow infty} sum_{i=1}^{m_n};mathcal{P}[N_{ni}(A) geq 1] = mu(A),$$ where $mu$ is some measure. If these two conditions hold for a u.a.n. array, then $lim_{nrightarrow infty} N_n$ is a Poisson process with intensity $mu$.
Question: Consider an u.a.n. array of Poisson point processes on $mathbb{R}$ where $N_{ni}$ is Poisson process of rate $lambda / n$ for $i = 1,...,n$ (here $m_n = n$). Superposition of each row ($N_n = sum_i N_{ni}$) is a Poisson process of rate $lambda$. Hence, the limit process is also a Poisson process of rate $lambda$. This is straightforward using the fact that superposition of independent Poisson process is a Poisson process with rate equal to sum of the rate of component Poisson processes.
Now, I want to establish the same result using the above theorem. We have $mathcal{P}[N_{ni}(A) geq 1] = frac{lambda}{n} mathcal{l}(A) + o(mathcal{l}(A))$ where $mathcal{l}$ is the lebesgue measure. The second condition in the theorem becomes $$ lim_{nrightarrow infty} sum_{i=1}^n ;mathcal{P}[N_{ni}(A) geq 1] = lim_{nrightarrow infty} sum_{i=1}^n left( frac{lambda}{n}mathcal{l}(A) + o(mathcal{l}(A))right) = lambda mathcal{l}(A) + lim_{nrightarrow infty} n, o(mathcal{l}(A)).$$ The term $lambda mathcal{l}(A)$ is exactly what is needed. But, how does it follow that $lim_{nrightarrow infty} n, o(mathcal{l}(A)) = 0 $? As far as I can see, there is no dependence on $n$ in $o(mathcal{l}(A))$.
Alternatively, for this specific case of Poisson processes, the term $mathcal{P},[N_{ni}(A) geq 1]$ can be written explicitly since $N_{ni}(A)$ is Poisson random variable with the mean $frac{lambda}{n} mathcal{l}(A)$. I have verified that writing each term this way, the above limit is in fact $lambda mathcal{l}(A)$. But, this is not what I am looking for. I feel there must be a way to handle $lim_{nrightarrow infty} n o(mathcal{l}(A))$. Expanding $mathcal{P},[N_{ni}(A) geq 1]$ explicitly gives hint that the $o$ term is actually $oleft(frac{mathcal{l}(A)}{n}right)$. But, I don't see how that happens in general.
I will be grateful for any hint/solution/explanation.
probability-limit-theorems point-processes
probability-limit-theorems point-processes
edited Dec 28 '18 at 3:56
Meagler
asked Dec 27 '18 at 16:50
MeaglerMeagler
12
12
add a comment |
add a comment |
0
active
oldest
votes
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%2f3054147%2fconvergence-of-row-superposition-of-null-array-to-poisson-point-process%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3054147%2fconvergence-of-row-superposition-of-null-array-to-poisson-point-process%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