Finite-state, discrete-time Markov chains

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorBoucher, Chris-
Data de aceite: dc.date.accessioned2019-08-21T19:27:42Z-
Data de disponibilização: dc.date.available2019-08-21T19:27:42Z-
Data de envio: dc.date.issued2009-
Data de envio: dc.date.issued2009-08-01-
Data de envio: dc.date.issued2013-04-05-
Data de envio: dc.date.issued2013-04-05-
Data de envio: dc.date.issued2013-04-05-
Fonte completa do material: dc.identifierhttp://objetoseducacionais2.mec.gov.br/handle/mec/23590-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/492516-
Descrição: dc.descriptionEducação Superior::Ciências Exatas e da Terra::Matemática-
Descrição: dc.descriptionConsider a system that is always in one of n states, numbered 1 through n. Every time a clock ticks, the system updates itself according to an nxn matrix of transition probabilities, the (i,j)th entry of which gives the probability that the system moves from state i to state j at any clock tick. A Markov chain is a system like this, in which the next state depends only on the current state and not on previous states. Powers of the transition matrix approach a matrix with constant columns as the power increases. The number to which the entries in the ith column converge is the asymptotic fraction of time the system spends in state i. The image on the upper left shows the states of the chain with the current state colored red, where what is "current" is determined by the time slider. The histogram tracks the number of visits to each state over the number of time steps determined by the time slider. The transition probabilities can be changed using the new transition matrix slider. For small chains, powers of the transition matrix are shown at the bottom-
Idioma: dc.languageen-
Publicador: dc.publisherWolfram Demonstration Project-
Relação: dc.relationFiniteStateDiscreteTimeMarkovChains.nbp-
Direitos: dc.rightsDemonstration freeware using MathematicaPlayer-
???dc.source???: dc.sourcehttp://demonstrations.wolfram.com/FiniteStateDiscreteTimeMarkovChains/-
Palavras-chave: dc.subjectProbability-
Palavras-chave: dc.subjectEducação Superior::Ciências Exatas e da Terra::Matemática::Matemática Aplicada-
Título: dc.titleFinite-state, discrete-time Markov chains-
???dc.description2???: dc.description2According to the clock's ticks, this object studies the transition probabilities of them, when they are numbered from 1 to n-
???dc.description3???: dc.description3This demonstration needs the "MathematicaPlayer.exe" to run. Find it in http://objetoseducacionais2.mec.gov.br/handle/mec/4737-
Aparece nas coleções:Repositório Institucional - MEC BIOE

Não existem arquivos associados a este item.