When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Markov Chains and Mixing Times - Wikipedia

    en.wikipedia.org/wiki/Markov_Chains_and_Mixing_Times

    A family of Markov chains is said to be rapidly mixing if the mixing time is a polynomial function of some size parameter of the Markov chain, and slowly mixing otherwise. This book is about finite Markov chains, their stationary distributions and mixing times, and methods for determining whether Markov chains are rapidly or slowly mixing. [1] [4]

  3. Markov chain mixing time - Wikipedia

    en.wikipedia.org/wiki/Markov_chain_mixing_time

    In probability theory, the mixing time of a Markov chain is the time until the Markov chain is "close" to its steady state distribution.. More precisely, a fundamental result about Markov chains is that a finite state irreducible aperiodic chain has a unique stationary distribution π and, regardless of the initial state, the time-t distribution of the chain converges to π as t tends to infinity.

  4. 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]

  5. Continuous-time Markov chain - Wikipedia

    en.wikipedia.org/wiki/Continuous-time_Markov_chain

    Another discrete-time process that may be derived from a continuous-time Markov chain is a δ-skeleton—the (discrete-time) Markov chain formed by observing X(t) at intervals of δ units of time. The random variables X (0), X (δ), X (2δ), ... give the sequence of states visited by the δ-skeleton.

  6. 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]

  7. Time reversibility - Wikipedia

    en.wikipedia.org/wiki/Time_reversibility

    Kolmogorov's criterion defines the condition for a Markov chain or continuous-time Markov chain to be time-reversible. Time reversal of numerous classes of stochastic processes has been studied, including Lévy processes , [ 3 ] stochastic networks ( Kelly's lemma ), [ 4 ] birth and death processes , [ 5 ] Markov chains , [ 6 ] and piecewise ...

  8. Examples of Markov chains - Wikipedia

    en.wikipedia.org/wiki/Examples_of_Markov_chains

    The states represent whether a hypothetical stock market is exhibiting a bull market, bear market, or stagnant market trend during a given week. According to the figure, a bull week is followed by another bull week 90% of the time, a bear week 7.5% of the time, and a stagnant week the other 2.5% of the time.

  9. Additive Markov chain - Wikipedia

    en.wikipedia.org/wiki/Additive_Markov_chain

    An additive Markov chain of order m is a sequence of random variables X 1, X 2, X 3, ..., possessing the following property: the probability that a random variable X n has a certain value x n under the condition that the values of all previous variables are fixed depends on the values of m previous variables only (Markov chain of order m), and the influence of previous variables on a generated ...