Total time spent in state $i$ before reaching state $i+1$












0














Let $T_k$ be the total cumulative time spent in state $i$ before reaching state $i+1$ in a continuous time birth-death process, with birth and death rates $lambda_k$ and $mu_k$. What is the distribution of $T_k$?
To solve this problem, I tried to set up the equation:



$P(T_k < z) = sum_{n=0}^infty P(T_k< z | N_k=n)*P(N_k=n)$



But, I ran into a problem calculating both $P(N_k=n)$, which should be geometrically distributed with $p=1-rho_{k,k}$, where $rho_{k,k}$ is the probability of returning to state k from state k in finite time. $P(T_k< z | N_k=n)$ having a gamma distribution also seems to complicate the problem.










share|cite|improve this question






















  • $rho_{k,k}$ is really the probability to return to $k$ starting from $k$ without hitting $k+1$ first. Finite time doesn't really have anything to do with it because the event of oscillating strictly below $k+1$ forever will have zero probability.
    – Ian
    Nov 27 at 3:39










  • I see. So then $rho_{k,k}$ is really the probability that we move from $k$ to $k-1$, or $frac{mu_k}{mu_k+lambda_k}$
    – jrstevens
    Nov 27 at 13:41












  • That is correct.
    – Ian
    Nov 27 at 14:10
















0














Let $T_k$ be the total cumulative time spent in state $i$ before reaching state $i+1$ in a continuous time birth-death process, with birth and death rates $lambda_k$ and $mu_k$. What is the distribution of $T_k$?
To solve this problem, I tried to set up the equation:



$P(T_k < z) = sum_{n=0}^infty P(T_k< z | N_k=n)*P(N_k=n)$



But, I ran into a problem calculating both $P(N_k=n)$, which should be geometrically distributed with $p=1-rho_{k,k}$, where $rho_{k,k}$ is the probability of returning to state k from state k in finite time. $P(T_k< z | N_k=n)$ having a gamma distribution also seems to complicate the problem.










share|cite|improve this question






















  • $rho_{k,k}$ is really the probability to return to $k$ starting from $k$ without hitting $k+1$ first. Finite time doesn't really have anything to do with it because the event of oscillating strictly below $k+1$ forever will have zero probability.
    – Ian
    Nov 27 at 3:39










  • I see. So then $rho_{k,k}$ is really the probability that we move from $k$ to $k-1$, or $frac{mu_k}{mu_k+lambda_k}$
    – jrstevens
    Nov 27 at 13:41












  • That is correct.
    – Ian
    Nov 27 at 14:10














0












0








0







Let $T_k$ be the total cumulative time spent in state $i$ before reaching state $i+1$ in a continuous time birth-death process, with birth and death rates $lambda_k$ and $mu_k$. What is the distribution of $T_k$?
To solve this problem, I tried to set up the equation:



$P(T_k < z) = sum_{n=0}^infty P(T_k< z | N_k=n)*P(N_k=n)$



But, I ran into a problem calculating both $P(N_k=n)$, which should be geometrically distributed with $p=1-rho_{k,k}$, where $rho_{k,k}$ is the probability of returning to state k from state k in finite time. $P(T_k< z | N_k=n)$ having a gamma distribution also seems to complicate the problem.










share|cite|improve this question













Let $T_k$ be the total cumulative time spent in state $i$ before reaching state $i+1$ in a continuous time birth-death process, with birth and death rates $lambda_k$ and $mu_k$. What is the distribution of $T_k$?
To solve this problem, I tried to set up the equation:



$P(T_k < z) = sum_{n=0}^infty P(T_k< z | N_k=n)*P(N_k=n)$



But, I ran into a problem calculating both $P(N_k=n)$, which should be geometrically distributed with $p=1-rho_{k,k}$, where $rho_{k,k}$ is the probability of returning to state k from state k in finite time. $P(T_k< z | N_k=n)$ having a gamma distribution also seems to complicate the problem.







probability probability-distributions markov-chains birth-death-process






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 27 at 3:35









jrstevens

84




84












  • $rho_{k,k}$ is really the probability to return to $k$ starting from $k$ without hitting $k+1$ first. Finite time doesn't really have anything to do with it because the event of oscillating strictly below $k+1$ forever will have zero probability.
    – Ian
    Nov 27 at 3:39










  • I see. So then $rho_{k,k}$ is really the probability that we move from $k$ to $k-1$, or $frac{mu_k}{mu_k+lambda_k}$
    – jrstevens
    Nov 27 at 13:41












  • That is correct.
    – Ian
    Nov 27 at 14:10


















  • $rho_{k,k}$ is really the probability to return to $k$ starting from $k$ without hitting $k+1$ first. Finite time doesn't really have anything to do with it because the event of oscillating strictly below $k+1$ forever will have zero probability.
    – Ian
    Nov 27 at 3:39










  • I see. So then $rho_{k,k}$ is really the probability that we move from $k$ to $k-1$, or $frac{mu_k}{mu_k+lambda_k}$
    – jrstevens
    Nov 27 at 13:41












  • That is correct.
    – Ian
    Nov 27 at 14:10
















$rho_{k,k}$ is really the probability to return to $k$ starting from $k$ without hitting $k+1$ first. Finite time doesn't really have anything to do with it because the event of oscillating strictly below $k+1$ forever will have zero probability.
– Ian
Nov 27 at 3:39




$rho_{k,k}$ is really the probability to return to $k$ starting from $k$ without hitting $k+1$ first. Finite time doesn't really have anything to do with it because the event of oscillating strictly below $k+1$ forever will have zero probability.
– Ian
Nov 27 at 3:39












I see. So then $rho_{k,k}$ is really the probability that we move from $k$ to $k-1$, or $frac{mu_k}{mu_k+lambda_k}$
– jrstevens
Nov 27 at 13:41






I see. So then $rho_{k,k}$ is really the probability that we move from $k$ to $k-1$, or $frac{mu_k}{mu_k+lambda_k}$
– jrstevens
Nov 27 at 13:41














That is correct.
– Ian
Nov 27 at 14:10




That is correct.
– Ian
Nov 27 at 14:10















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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015298%2ftotal-time-spent-in-state-i-before-reaching-state-i1%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015298%2ftotal-time-spent-in-state-i-before-reaching-state-i1%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Willebadessen

Ida-Boy-Ed-Garten

Residenzschloss Arolsen