ergodic chain

ergodic chain
мат. эргодическая цепь

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем решить контрольную работу

Смотреть что такое "ergodic chain" в других словарях:

  • Ergodic (adjective) — In mathematics and physics, the adjective ergodic is used to imply that a system satisfies the ergodic hypothesis of thermodynamics or that it is a system studied in ergodic theory. Formal definitionLet (X, Sigma, mu) be a probability space, and… …   Wikipedia

  • Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized …   Wikipedia

  • Ergodicity — For other uses, see Ergodic (disambiguation). In mathematics, the term ergodic is used to describe a dynamical system which, broadly speaking, has the same behavior averaged over time as averaged over space. In physics the term is used to imply… …   Wikipedia

  • Subshift of finite type — In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory. They also describe the set of all possible sequences executed by a finite state… …   Wikipedia

  • John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann …   Wikipedia

  • Conductance (probability) — For an ergodic reversible Markov chain with an underlying graph G , the conductance is a way to measure how hard it is to leave a small set of nodes. Formally, the conductance of a graph is defined as the minimum over all sets S of the capacity… …   Wikipedia

  • Conductance (graph) — For other uses, see Conductance. In graph theory the conductance of a graph G=(V,E) measures how well knit the graph is: it controls how fast a random walk on G converges to a uniform distribution. The conductance of a graph is often called the… …   Wikipedia

  • Markov decision process — Markov decision processes (MDPs), named after Andrey Markov, provide a mathematical framework for modeling decision making in situations where outcomes are partly random and partly under the control of a decision maker. MDPs are useful for… …   Wikipedia

  • Statistical ensemble (mathematical physics) — In mathematical physics, especially as introduced into statistical mechanics and thermodynamics by J. Willard Gibbs in 1878, an ensemble (also statistical ensemble or thermodynamic ensemble)cite book |last=Kittel |first=Charles… …   Wikipedia

  • Mixing (mathematics) — In mathematics, mixing is an abstract concept originating from physics: the attempt to describe the irreversible thermodynamic process of mixing in the everyday world: mixing paint, mixing drinks, etc. The concept appears in ergodic theory the… …   Wikipedia

  • Chaos theory — This article is about chaos theory in Mathematics. For other uses of Chaos theory, see Chaos Theory (disambiguation). For other uses of Chaos, see Chaos (disambiguation). A plot of the Lorenz attractor for values r = 28, σ = 10, b = 8/3 …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»