enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Markov chain - Wikipedia

    en.wikipedia.org/wiki/Markov_chain

    If the Markov chain is time-homogeneous, then the transition matrix P is the same after each step, so the k-step transition probability can be computed as the k-th power of the transition matrix, P k. If the Markov chain is irreducible and aperiodic, then there is a unique stationary distribution π. [41]

  3. Transition-rate matrix - Wikipedia

    en.wikipedia.org/wiki/Transition-rate_matrix

    In probability theory, a transition-rate matrix (also known as a Q-matrix, [1] intensity matrix, [2] or infinitesimal generator matrix [3]) is an array of numbers describing the instantaneous rate at which a continuous-time Markov chain transitions between states.

  4. Markovian arrival process - Wikipedia

    en.wikipedia.org/wiki/Markovian_arrival_process

    A Markov arrival process is defined by two matrices, D 0 and D 1 where elements of D 0 represent hidden transitions and elements of D 1 observable transitions. The block matrix Q below is a transition rate matrix for a continuous-time Markov chain.

  5. Discrete phase-type distribution - Wikipedia

    en.wikipedia.org/wiki/Discrete_phase-type...

    The transition matrix is characterized entirely by its upper-left block . Definition. A distribution on {,,,...} is a discrete phase-type distribution if it is the distribution of the first passage time to the absorbing state of a terminating Markov chain with finitely many states.

  6. Stochastic matrix - Wikipedia

    en.wikipedia.org/wiki/Stochastic_matrix

    In mathematics, a stochastic matrix is a square matrix used to describe the transitions of a Markov chain. Each of its entries is a nonnegative real number representing a probability. [1] [2]: 10 It is also called a probability matrix, transition matrix, substitution matrix, or Markov matrix.

  7. Continuous-time Markov chain - Wikipedia

    en.wikipedia.org/wiki/Continuous-time_Markov_chain

    We say is Markov with initial distribution and rate matrix to mean: the trajectories of are almost surely right continuous, let be a modification of to have (everywhere) right-continuous trajectories, (()) = + almost surely (note to experts: this condition says is non-explosive), the state sequence (()) is a discrete-time Markov chain with ...

  8. Balance equation - Wikipedia

    en.wikipedia.org/wiki/Balance_equation

    For a continuous time Markov chain (CTMC) with transition rate matrix, if can be found such that for every pair of states and π i q i j = π j q j i {\displaystyle \pi _{i}q_{ij}=\pi _{j}q_{ji}} holds, then by summing over j {\displaystyle j} , the global balance equations are satisfied and π {\displaystyle \pi } is the stationary ...

  9. M/M/1 queue - Wikipedia

    en.wikipedia.org/wiki/M/M/1_queue

    Download as PDF; Printable version; In other projects ... This is the same continuous time Markov chain as in a birth–death process. The state space diagram for ...