Let $N_n:=\{1,2,\cdots,n\}$. Given two finite states Markov chains $\big(X^{(j)}_i\in N_n\}\big)_{i=0}^\infty$ for $j\in\{1,2\}$, both of which have one absorbing state $1$. Pr$(X^{(1)}_{i+1}=1|X_i=1)=$Pr$(X^{(2)}_{i+1}=1|X_i=1)=1, \,\forall a\in N_n$. $$\text{Pr}\big(X^{(1)}_{i+1}=b|X_i=a\big)>\text{Pr}\big(X^{(2)}_{i+1}=b|X_i=a\big)>0, \,\forall 1<a<b, a,b\in N_n,$$ $$0<\text{Pr}\big(X^{(1)}_{i+1}=b|X_i=a\big)\le \text{Pr}\big(X^{(2)}_{i+1}=b|X_i=a\big), \,\forall a\ge b, a>1, a,b\in N_n.$$ Is the following true? $$\text{Pr}\big(X^{(1)}\text{ reaches } b|X^{(1)}_0=a\big)>\text{Pr}\big(X^{(2)}\text{ reaches }b|X^{(2)}_0=a\big), \,\forall a<b,$$ and $$\text{Pr}(X^{(1)}\text{ reaches }b|X^{(1)}_0=a)\le\text{Pr}(X^{(2)}\text{ reaches }b|X^{(2)}_0=a), \,\forall a \ge b.$$
This math.stackexchange.com answer states that it is not true for an irreducible transition probability matrix compared to a reducible transition probability matrix. But is it true for two chains each of which has only one absorbing state?
Would a coupling argument help to resolve this problem?
Here is the version 2 of this question under a more stringent condition.
\mathrm{Pr}
to get $\mathrm{Pr}$ in math mode, if you insist on a Roman font, instead of switching in and out of math mode which makes the formatting look bad. You can also use\text{...}
within math mode to get words: $\mathrm{Pr}(X^{(2)} \text{ reaches } b \dots)$ $\endgroup$$$ eqn $$
. $\endgroup$