definition of a sample path of a stochastic process












1














Why do we fix $omega$ in the definition of a sample path of a stochastic process? If $f:T to Omega$ is an arbitrary function, can't we define sample path to be equal to ${X(t, f(t)): t in T}$?










share|cite|improve this question


















  • 1




    A sample path is usually function $Ttomathbb R$ prescribed by $tmapsto X_t(omega)$. Every $omegainOmega$ induces such a function. In that sense the label "sample path" is reserved. What is the use placing the label also on sets (so not functions) as described in your question?
    – drhab
    Nov 27 at 13:35






  • 1




    They are not exactly the same. You can at most say that the function $tmapsto X_t(omega)$ is a special case of the (more general) $tmapsto X_t(f(t))$. It arises if $f$ is a constant function. If you are interested in this more general case then it might be handy to find a suitable label for it. Labels that allready exist must not be used for that.
    – drhab
    Nov 27 at 14:19








  • 1




    I don't understand what you are trying to say. What is the role of the concept "iid" in this? If $f$ is not a constant function then it is most unlikely that you can find an $omegainOmega$ such that the functions $tmapsto X_t(omega)$ and $tmapsto X_t(f(t))$ are the same.
    – drhab
    Nov 27 at 14:35








  • 1




    If we identify heads with $0$ and tails with $1$ then in that situation $Omega={0,1}^T$ for $T=mathbb N$. Then a stochastic process can be looked at as a function $X:mathbb NtimesOmegatomathbb R$. Setting $X_n:=X(n,-):Omegatomathbb R$ it can be looked at as collection of random variables: ${X_nmid ninmathbb N}$. A sample path is then a function $mathbb Ntomathbb R$ prescribed by $nmapsto X_n(omega)$ or (if you like that more) a sequence $(X_1(omega),X_2(omega),cdots)$
    – drhab
    Nov 28 at 13:43






  • 1




    You call $omega$ an element of $Omega^T_{X_t}$ in that context. I don't know what you mean by that. $omega$ is an element of $Omega$. In this case that means that any $omega$ can be looked at as a sequence like $(0,0,1,0,1,1,0,dots)$.
    – drhab
    Nov 28 at 13:45


















1














Why do we fix $omega$ in the definition of a sample path of a stochastic process? If $f:T to Omega$ is an arbitrary function, can't we define sample path to be equal to ${X(t, f(t)): t in T}$?










share|cite|improve this question


















  • 1




    A sample path is usually function $Ttomathbb R$ prescribed by $tmapsto X_t(omega)$. Every $omegainOmega$ induces such a function. In that sense the label "sample path" is reserved. What is the use placing the label also on sets (so not functions) as described in your question?
    – drhab
    Nov 27 at 13:35






  • 1




    They are not exactly the same. You can at most say that the function $tmapsto X_t(omega)$ is a special case of the (more general) $tmapsto X_t(f(t))$. It arises if $f$ is a constant function. If you are interested in this more general case then it might be handy to find a suitable label for it. Labels that allready exist must not be used for that.
    – drhab
    Nov 27 at 14:19








  • 1




    I don't understand what you are trying to say. What is the role of the concept "iid" in this? If $f$ is not a constant function then it is most unlikely that you can find an $omegainOmega$ such that the functions $tmapsto X_t(omega)$ and $tmapsto X_t(f(t))$ are the same.
    – drhab
    Nov 27 at 14:35








  • 1




    If we identify heads with $0$ and tails with $1$ then in that situation $Omega={0,1}^T$ for $T=mathbb N$. Then a stochastic process can be looked at as a function $X:mathbb NtimesOmegatomathbb R$. Setting $X_n:=X(n,-):Omegatomathbb R$ it can be looked at as collection of random variables: ${X_nmid ninmathbb N}$. A sample path is then a function $mathbb Ntomathbb R$ prescribed by $nmapsto X_n(omega)$ or (if you like that more) a sequence $(X_1(omega),X_2(omega),cdots)$
    – drhab
    Nov 28 at 13:43






  • 1




    You call $omega$ an element of $Omega^T_{X_t}$ in that context. I don't know what you mean by that. $omega$ is an element of $Omega$. In this case that means that any $omega$ can be looked at as a sequence like $(0,0,1,0,1,1,0,dots)$.
    – drhab
    Nov 28 at 13:45
















1












1








1







Why do we fix $omega$ in the definition of a sample path of a stochastic process? If $f:T to Omega$ is an arbitrary function, can't we define sample path to be equal to ${X(t, f(t)): t in T}$?










share|cite|improve this question













Why do we fix $omega$ in the definition of a sample path of a stochastic process? If $f:T to Omega$ is an arbitrary function, can't we define sample path to be equal to ${X(t, f(t)): t in T}$?







stochastic-processes






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 27 at 13:22









Denisof

856




856








  • 1




    A sample path is usually function $Ttomathbb R$ prescribed by $tmapsto X_t(omega)$. Every $omegainOmega$ induces such a function. In that sense the label "sample path" is reserved. What is the use placing the label also on sets (so not functions) as described in your question?
    – drhab
    Nov 27 at 13:35






  • 1




    They are not exactly the same. You can at most say that the function $tmapsto X_t(omega)$ is a special case of the (more general) $tmapsto X_t(f(t))$. It arises if $f$ is a constant function. If you are interested in this more general case then it might be handy to find a suitable label for it. Labels that allready exist must not be used for that.
    – drhab
    Nov 27 at 14:19








  • 1




    I don't understand what you are trying to say. What is the role of the concept "iid" in this? If $f$ is not a constant function then it is most unlikely that you can find an $omegainOmega$ such that the functions $tmapsto X_t(omega)$ and $tmapsto X_t(f(t))$ are the same.
    – drhab
    Nov 27 at 14:35








  • 1




    If we identify heads with $0$ and tails with $1$ then in that situation $Omega={0,1}^T$ for $T=mathbb N$. Then a stochastic process can be looked at as a function $X:mathbb NtimesOmegatomathbb R$. Setting $X_n:=X(n,-):Omegatomathbb R$ it can be looked at as collection of random variables: ${X_nmid ninmathbb N}$. A sample path is then a function $mathbb Ntomathbb R$ prescribed by $nmapsto X_n(omega)$ or (if you like that more) a sequence $(X_1(omega),X_2(omega),cdots)$
    – drhab
    Nov 28 at 13:43






  • 1




    You call $omega$ an element of $Omega^T_{X_t}$ in that context. I don't know what you mean by that. $omega$ is an element of $Omega$. In this case that means that any $omega$ can be looked at as a sequence like $(0,0,1,0,1,1,0,dots)$.
    – drhab
    Nov 28 at 13:45
















  • 1




    A sample path is usually function $Ttomathbb R$ prescribed by $tmapsto X_t(omega)$. Every $omegainOmega$ induces such a function. In that sense the label "sample path" is reserved. What is the use placing the label also on sets (so not functions) as described in your question?
    – drhab
    Nov 27 at 13:35






  • 1




    They are not exactly the same. You can at most say that the function $tmapsto X_t(omega)$ is a special case of the (more general) $tmapsto X_t(f(t))$. It arises if $f$ is a constant function. If you are interested in this more general case then it might be handy to find a suitable label for it. Labels that allready exist must not be used for that.
    – drhab
    Nov 27 at 14:19








  • 1




    I don't understand what you are trying to say. What is the role of the concept "iid" in this? If $f$ is not a constant function then it is most unlikely that you can find an $omegainOmega$ such that the functions $tmapsto X_t(omega)$ and $tmapsto X_t(f(t))$ are the same.
    – drhab
    Nov 27 at 14:35








  • 1




    If we identify heads with $0$ and tails with $1$ then in that situation $Omega={0,1}^T$ for $T=mathbb N$. Then a stochastic process can be looked at as a function $X:mathbb NtimesOmegatomathbb R$. Setting $X_n:=X(n,-):Omegatomathbb R$ it can be looked at as collection of random variables: ${X_nmid ninmathbb N}$. A sample path is then a function $mathbb Ntomathbb R$ prescribed by $nmapsto X_n(omega)$ or (if you like that more) a sequence $(X_1(omega),X_2(omega),cdots)$
    – drhab
    Nov 28 at 13:43






  • 1




    You call $omega$ an element of $Omega^T_{X_t}$ in that context. I don't know what you mean by that. $omega$ is an element of $Omega$. In this case that means that any $omega$ can be looked at as a sequence like $(0,0,1,0,1,1,0,dots)$.
    – drhab
    Nov 28 at 13:45










1




1




A sample path is usually function $Ttomathbb R$ prescribed by $tmapsto X_t(omega)$. Every $omegainOmega$ induces such a function. In that sense the label "sample path" is reserved. What is the use placing the label also on sets (so not functions) as described in your question?
– drhab
Nov 27 at 13:35




A sample path is usually function $Ttomathbb R$ prescribed by $tmapsto X_t(omega)$. Every $omegainOmega$ induces such a function. In that sense the label "sample path" is reserved. What is the use placing the label also on sets (so not functions) as described in your question?
– drhab
Nov 27 at 13:35




1




1




They are not exactly the same. You can at most say that the function $tmapsto X_t(omega)$ is a special case of the (more general) $tmapsto X_t(f(t))$. It arises if $f$ is a constant function. If you are interested in this more general case then it might be handy to find a suitable label for it. Labels that allready exist must not be used for that.
– drhab
Nov 27 at 14:19






They are not exactly the same. You can at most say that the function $tmapsto X_t(omega)$ is a special case of the (more general) $tmapsto X_t(f(t))$. It arises if $f$ is a constant function. If you are interested in this more general case then it might be handy to find a suitable label for it. Labels that allready exist must not be used for that.
– drhab
Nov 27 at 14:19






1




1




I don't understand what you are trying to say. What is the role of the concept "iid" in this? If $f$ is not a constant function then it is most unlikely that you can find an $omegainOmega$ such that the functions $tmapsto X_t(omega)$ and $tmapsto X_t(f(t))$ are the same.
– drhab
Nov 27 at 14:35






I don't understand what you are trying to say. What is the role of the concept "iid" in this? If $f$ is not a constant function then it is most unlikely that you can find an $omegainOmega$ such that the functions $tmapsto X_t(omega)$ and $tmapsto X_t(f(t))$ are the same.
– drhab
Nov 27 at 14:35






1




1




If we identify heads with $0$ and tails with $1$ then in that situation $Omega={0,1}^T$ for $T=mathbb N$. Then a stochastic process can be looked at as a function $X:mathbb NtimesOmegatomathbb R$. Setting $X_n:=X(n,-):Omegatomathbb R$ it can be looked at as collection of random variables: ${X_nmid ninmathbb N}$. A sample path is then a function $mathbb Ntomathbb R$ prescribed by $nmapsto X_n(omega)$ or (if you like that more) a sequence $(X_1(omega),X_2(omega),cdots)$
– drhab
Nov 28 at 13:43




If we identify heads with $0$ and tails with $1$ then in that situation $Omega={0,1}^T$ for $T=mathbb N$. Then a stochastic process can be looked at as a function $X:mathbb NtimesOmegatomathbb R$. Setting $X_n:=X(n,-):Omegatomathbb R$ it can be looked at as collection of random variables: ${X_nmid ninmathbb N}$. A sample path is then a function $mathbb Ntomathbb R$ prescribed by $nmapsto X_n(omega)$ or (if you like that more) a sequence $(X_1(omega),X_2(omega),cdots)$
– drhab
Nov 28 at 13:43




1




1




You call $omega$ an element of $Omega^T_{X_t}$ in that context. I don't know what you mean by that. $omega$ is an element of $Omega$. In this case that means that any $omega$ can be looked at as a sequence like $(0,0,1,0,1,1,0,dots)$.
– drhab
Nov 28 at 13:45






You call $omega$ an element of $Omega^T_{X_t}$ in that context. I don't know what you mean by that. $omega$ is an element of $Omega$. In this case that means that any $omega$ can be looked at as a sequence like $(0,0,1,0,1,1,0,dots)$.
– drhab
Nov 28 at 13:45

















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%2f3015761%2fdefinition-of-a-sample-path-of-a-stochastic-process%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%2f3015761%2fdefinition-of-a-sample-path-of-a-stochastic-process%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

How do I know what Microsoft account the skydrive app is syncing to?

When does type information flow backwards in C++?

Grease: Live!