I was trying to understand the difference between strong Markov property and the usual Markov property for a discrete number of states. I think I understand why the strong Markov property implies the usual one : We have to consider a deterministic stopping time $T(\omega)=t_0$, right?
But what would be a simple example (like coin toss, dice toss,...) where we have the Markov property but not the strong Markov property?
2026-03-25 17:45:08.1774460708
Strong markov property vs usual markov property.
1.4k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY-THEORY
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Another application of the Central Limit Theorem
- proving Kochen-Stone lemma...
- Is there a contradiction in coin toss of expected / actual results?
- Sample each point with flipping coin, what is the average?
- Random variables coincide
- Reference request for a lemma on the expected value of Hermitian polynomials of Gaussian random variables.
- Determine the marginal distributions of $(T_1, T_2)$
- Convergence in distribution of a discretized random variable and generated sigma-algebras
Related Questions in RANDOM-VARIABLES
- Prove that central limit theorem Is applicable to a new sequence
- Random variables in integrals, how to analyze?
- Convergence in distribution of a discretized random variable and generated sigma-algebras
- Determine the repartition of $Y$
- What is the name of concepts that are used to compare two values?
- Convergence of sequences of RV
- $\lim_{n \rightarrow \infty} P(S_n \leq \frac{3n}{2}+\sqrt3n)$
- PDF of the sum of two random variables integrates to >1
- Another definition for the support of a random variable
- Uniform distribution on the [0,2]
Related Questions in MARKOV-CHAINS
- Calculating probabilities using Markov chains.
- Probability being in the same state
- Random walk on $\mathbb{Z}^2$
- Polya's Urn and Conditional Independence
- Markov Chain never reaches a state
- Finding a mixture of 1st and 0'th order Markov models that is closest to an empirical distribution
- Find probability function of random walk, stochastic processes
- Generating cycles on a strongly connected graph
- Will be this random walk a Markov chain?
- An irreducible Markov chain cannot have an absorbing state
Related Questions in STOPPING-TIMES
- Need to find Conditions to get a (sub-)martingale
- What techniques for proving that a stopping time is finite almost surely?
- Discrete martingale stopping time
- Optional Stopping Theorem for martingales
- Prove that stopped discrete time nonnegative supermartingales are uniformly integrable
- optimal strategy for drawing a deck of cards
- $\frac1n \sum_{i=1}^n W_i(T_i)\to 0$ a.s. for $n\to\infty$
- Brownian Motion Hitting Time of a line with a negative axis intercept
- Random walk with barriers: estimate time since the appearance of a barrier
- Generalizing a proof for the density of stopped subordinators
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Any discrete time Markov chain has the strong Markov property; the same holds for a continuous time chain with a stopping time that only takes a countable set of values. This is actually not too bad to prove, just conditioning on the particular realisation of the stopping time. You can read about the strong Markov property in James Norris' book, in particular Section 1.4 -- this is for discrete time. As you point out, strong Markov implies Markov by just taking the stopping time deterministic. So you can't come up with a chain that has one but not the other :)
For continuous time, it is more subtle. These lecture notes give a counterexample -- Example 167. (The full lecture notes can be found here.)