Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Discrete-time Markov chain 7 found (16 total)

alternate case: discrete-time Markov chain

Additive Markov chain (785 words) [view diff] exact match in snippet view article find links to article

additive conditional probability function. Here the process is a discrete-time Markov chain of order m and the transition probability to a state at the next
Leslie matrix (1,224 words) [view diff] exact match in snippet view article find links to article
the Euler–Lotka equation. The Leslie model is very similar to a discrete-time Markov chain. The main difference is that in a Markov model, one would have
Foster's theorem (274 words) [view diff] exact match in snippet view article find links to article
from it within a finite time interval. Consider an irreducible discrete-time Markov chain on a countable state space S {\displaystyle S} having a transition
G/M/1 queue (729 words) [view diff] exact match in snippet view article find links to article
process U n = X A n − {\displaystyle U_{n}=X_{A_{n}-}} . This is a discrete-time Markov chain with stochastic matrix: P = ( 1 − a 0 a 0 0 0 0 ⋯ 1 − ( a 0 +
Random element (1,890 words) [view diff] exact match in snippet view article find links to article
random variables (for example, see Markov chain, also known as discrete-time Markov chain). Given a probability space ( Ω , F , P ) {\displaystyle (\Omega
Diffusion map (2,469 words) [view diff] exact match in snippet view article find links to article
) {\displaystyle (X,k)} , we can then construct a reversible discrete-time Markov chain on X {\displaystyle X} (a process known as the normalized graph
Exponential backoff (3,340 words) [view diff] exact match in snippet view article find links to article
and congestion collapse. To understand stability, Lam created a discrete-time Markov chain model for analyzing the statistical behaviour of slotted ALOHA