How Can You Prove a Process is Markov?

  • Thread starter Thread starter vale
  • Start date Start date
  • Tags Tags
    Process
AI Thread Summary
To prove that a process P_t is Markov, it is essential to demonstrate that the transition probabilities are independent of past states. The discussion centers on a mean-reverting Brownian bridge and a proportional volatility process, with the dynamics influenced by an exogenous bootstrap procedure. A mathematical approach involves showing that the future state P(t+1) can be expressed as a function of the current state P(t) and independent random variables. The independence of the Wiener process W(t) from past values supports the Markov property. Ultimately, establishing these relationships mathematically confirms the Markovian nature of the process.
vale
Messages
3
Reaction score
0
This is my first time here, so... Hi everybody!

I've very little time to figure out the following problem ... and I am wandering if some of you can give me any help or just suggest me any good reading material...

The question is how you can prove a process P_t, given the dynamics, is Markov.
In short my process is on alternate intervals, a mean reverting brownian bridge dP_t = \frac{\alpha}{G-t}(Q-P_t)dt + \sigma dW_t, and a mean reverting proportional volatility process : dP_t = K(\theta -P_t)dt + \nu dW_t. The length of the intervals and their occurence is determined by an exogenous bootstrap procedure, which I believe, doesn't give any problems, being a resampling procedure with replacement, it doesn't generate any dependence with the past history...

How should I procede on your opinion? Any hints ?

Thank you very much in advance,
Vale
 
Physics news on Phys.org
Could this be of any help? When you say prove, do you mean empirically or mathematically?
 
Thank you for the reference and the reply!

Actually I meant a mathematical proof...
I think I should show somehow the transition probabilities are independent from the past realizations... but I don't Know how to retrieve them from the dynamic... :rolleyes:

Many thanks...
Vale
 
I guess I'd argue W(t) is independent of the past. Then equate Eq. (1) to Eq. (2) and solve for P(t). It'll be a function of t, W(t) and some constants. Since W is independent of the past, so's P(t).

{P.S. Oh, whoops! You said "on alternating intervals." Does that mean the two Eq's do not hold simultaneously?}

{P.P.S. In that case:

P(t+1) = P(t) + dP(t) = P(t) + a(dt) P(t) + b dW(t) = [a(dt)+1] P(t) + b dW(t).

Et+1[P(t+1)|P(t),P(t-1)...,P(0)] = (a+1) Et+1[P(t)|P(t),P(t-1)...,P(0)] + b Et+1[dW(t)|P(t),P(t-1)...,P(0)] = (a+1) P(t) + b Et+1[dW(t)]. QED

The last step is based on two premises: (i) E[X|X,Y,Z,...] = X, and (ii) dW(t) is independent of past history so E[dW(t)|P(t),P(t-1)...,P(0)] = E[dW(t)].}
 
Last edited:
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top