query: $ (X_n : n = 1, 2, ...) $ is a Markov chain with state space $(-1, 0, 1)$.
positive_passages.docid: 29420
positive_passages.text: 2 Questions about Markov chain
negative_passages.docid: 13390
negative_passages.text: Recursive Monotone Decreasing Sequence Proof ${x_{k}} = \frac{1}{2}\left({x_{k-1}+\frac{a}{{x_{k-1}}}}\right)$
negative_passages.docid: 142534
negative_passages.text: Proof of $k {n\choose k} = n {n-1 \choose k-1}$ using direct proof
negative_passages.docid: 67177
negative_passages.text: Markov chains, cellular automata, and raster algebra
negative_passages.docid: 11998
negative_passages.text: In how many sequences of length $n$, the difference between every 2 adjacent elements is $1$ or $-1$?
negative_passages.docid: 86099
negative_passages.text: Probability of a run of k successes in a sequence of n Bernoulli trials
negative_passages.docid: 112001
negative_passages.text: The sum of $n$ independent normal random variables.
negative_passages.docid: 66019
negative_passages.text: Revisited: Binomial Theorem: An Inductive Proof
negative_passages.docid: 64192
negative_passages.text: State space representation of ARMA(p,q) from Hamilton
negative_passages.docid: 110495
negative_passages.text: $X_n \to X, Y_n \to c$ in distribution implies $X_n Y_n \to Xc$ in distribution
negative_passages.docid: 9522
negative_passages.text: Proving $k \binom{n}{k} = n \binom{n-1}{k-1}$
negative_passages.docid: 110662
negative_passages.text: Show that $P(\mathbb{N})$ is equivalent to $2^\mathbb{N}$
negative_passages.docid: 70282
negative_passages.text: Help finding a combinatorial proof of $k {n \choose k } = n {n - 1 \choose k -1}$
negative_passages.docid: 68512
negative_passages.text: $\sigma$ algebra of collection of random variables
negative_passages.docid: 147661
negative_passages.text: Show that {$x_n$} is a convergent sequence if $d(x_{n+2}, x_{n+1})≤ rd(x_{n+1}, x_n)$
negative_passages.docid: 13723
negative_passages.text: Doubly stochastic matrix proof
negative_passages.docid: 58663
negative_passages.text: How to show that if $\phi(n)$ equals to n itself, then n must be 1?