MHB Modified Random Walk: Expected Duration and Recurrence Equation Analysis

AI Thread Summary
The discussion focuses on deriving a recurrence equation for the expected duration of a modified random walk by conditioning on the first step. It presents a specific equation format involving expected values and parameters represented as ˜p, ˜q, and ˜c. Participants are asked to identify these parameters in relation to the original variables p, q, and r. Additionally, there is a request for clarification on the definition of the modified random walk. The conversation emphasizes the mathematical formulation and relationships necessary for analysis.
Poirot1
Messages
243
Reaction score
0

(1)Consider the expected duration of the modified random walk. Show that conditioning on the first step produces a recurrence equation of the following form.​
Ea = ˜pEa+1 + ˜qEa1 + ˜c.
(2)Clearly identify the values of ˜p, ˜q and ˜c in terms of p, q and r.
Thanks
 
Physics news on Phys.org
Poirot said:

(1)Consider the expected duration of the modified random walk. Show that conditioning on the first step produces a recurrence equation of the following form.​
Ea = ˜pEa+1 + ˜qEa1 + ˜c.
(2)Clearly identify the values of ˜p, ˜q and ˜c in terms of p, q and r.
Thanks


Please post the entire question, in particular the definition of your modified random walk

CB
 
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