# Category:Markov processes

Computing portal |

Here is a list of articles in the category **Markov processes** of the Computing portal that unifies foundations of mathematics and computations using computers. This category is for articles about the theory of Markov chains and processes, and associated processes. See Category:Markov models for models for specific applications that make use of Markov processes.

## Pages in category "Markov processes"

The following 62 pages are in this category, out of 62 total.

### A

- Absorbing Markov chain
*(computing)* - Additive Markov chain
*(computing)*

### B

- Birth process
*(computing)* - Birth–death process
*(computing)* - Branching process
*(computing)* - Brownian meander
*(computing)* - Burstiness
*(computing)*

### C

- Chapman–Kolmogorov equation
*(computing)* - Conductance (graph)
*(computing)*

### D

- Decentralized partially observable Markov decision process
*(computing)* - Diffusion process
*(computing)* - Dirichlet form
*(computing)*

### F

- Feller process
*(computing)* - Fleming–Viot process
*(computing)* - Foster's theorem
*(computing)*

### G

- Gauss–Markov process
*(computing)* - Geometric process
*(computing)*

### H

- Harris chain
*(computing)* - Hunt process
*(computing)*

### I

- Ionescu-Tulcea theorem
*(computing)*

### K

- Kelly's lemma
*(computing)* - Kemeny's constant
*(computing)* - Kolmogorov equations
*(computing)* - Kolmogorov equations (Markov jump process)
*(computing)* - Kolmogorov's criterion
*(computing)*

### L

- Lévy flight
*(computing)* - Lumpability
*(computing)*

### M

- Markov additive process
*(computing)* - Markov chain approximation method
*(computing)* - Markov chain central limit theorem
*(computing)* - Markov chain mixing time
*(computing)* - Markov Chains and Mixing Times
*(computing)* - Markov chains on a measurable state space
*(computing)* - Markov decision process
*(computing)* - Markov information source
*(computing)* - Markov kernel
*(computing)* - Markov chain
*(computing)* - Markov property
*(computing)* - Markov renewal process
*(computing)* - Markov reward model
*(computing)* - Markovian arrival process
*(computing)* - Matrix analytic method
*(computing)* - Memorylessness
*(computing)* - Multiscale decision-making
*(computing)*

### N

- Nearly completely decomposable Markov chain
*(computing)*

### O

- Optimistic knowledge gradient
*(computing)* - Ornstein–Uhlenbeck process
*(computing)*

### P

- Partially observable Markov decision process
*(computing)* - Perron–Frobenius theorem
*(computing)* - Piecewise-deterministic Markov process
*(computing)* - Poisson clumping
*(computing)* - Poisson point process
*(computing)*

### Q

- Quasi-birth–death process
*(computing)* - Queueing theory
*(computing)*

### R

- Random surfing model
*(computing)*

### S

- Spectral expansion solution
*(computing)* - Stochastic cellular automaton
*(computing)* - Subshift of finite type
*(computing)*

### T

- Telescoping Markov chain
*(computing)* - Transition rate matrix
*(computing)*

### U

- Uniformization (probability theory)
*(computing)*

### V

- Vacancy chain
*(computing)*