= Immigration chain with complete population resets
{title2=$\pi_0=p/(1+p),\quad\pi_j=p(1-p)^{j-1}/(1+p)$}
Fix $0<p<1$. The <immigration chain with complete population resets> has states $0,1,2,\ldots$: from zero it moves to one, and from a positive state $j$ it moves to zero with <Probability> $p$ or to $j+1$ with <Probability> $1-p$. Its <Stationary distribution> is
$$
\pi_0=\frac p{1+p},\qquad
\pi_j=\frac{p(1-p)^{j-1}}{1+p}\quad(j\geq1).
$$
<stationary distribution>[Stationarity] gives $\pi_1=\pi_0$ and $\pi_j=(1-p)^{j-1}\pi_0$ for $j\geq1$. Summing the geometric tail yields total mass $\pi_0(1+1/p)$, giving the normalization.
Every state communicates with zero, and a return from zero takes one initial step plus a positive-support geometric waiting time of <mean> $1/p$. Thus the chain is <irreducible Markov chain>[irreducible] and <positive recurrent Markov chain>[positive recurrent]. Return lengths two and three have positive <Probability>, making it <aperiodic Markov chain>[aperiodic]. The ergodic occupation fraction above a positive <integer> $K$ is the stationary tail $(1-p)^K/(1+p)$.
The endpoint cases have different behavior. At $p=1$, the closed class $\{0,1\}$ alternates deterministically and is <periodic Markov chain>[periodic]; the full countable chain is not <irreducible Markov chain>[irreducible]. At $p=0$, the chain increases forever and the displayed zero weights do not normalize. The strict parameter <interval> is therefore needed for the <irreducible Markov chain>[irreducibility] and <aperiodic Markov chain>[aperiodicity] claims.
Back to article page