This HTML5 document contains 54 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15http://dbpedia.org/resource/File:
n7http://demonstrations.wolfram.com/AbsorbingMarkovChain/
n11http://www.bewersdorff-online.de/amonopoly/
n16https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-fahttp://fa.dbpedia.org/resource/
n10http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Absorbing_Markov_chain
rdf:type
dbo:Company yago:Model110324560 yago:Organism100004475 yago:Worker109632518 yago:CausalAgent100007347 yago:Assistant109815790 yago:Person100007846 yago:YagoLegalActor yago:YagoLegalActorGeo yago:Object100002684 yago:LivingThing100004258 yago:WikicatMarkovModels yago:PhysicalEntity100001930 yago:Whole100003553
rdfs:label
Absorbing Markov chain
rdfs:comment
In the mathematical theory of probability, an absorbing Markov chain is a Markov chain in which every state can reach an absorbing state. An absorbing state is a state that, once entered, cannot be left. Like general Markov chains, there can be continuous-time absorbing Markov chains with an infinite state space. However, this article concentrates on the discrete-time discrete-state-space case.
foaf:depiction
n10:Hivmodelmarkov.png n10:Drunkard’s_walk.svg n10:Probability_of_winning_Snakes_and_Ladders_by_turns.svg
dcterms:subject
dbc:Markov_models dbc:Markov_processes
dbo:wikiPageID
33785111
dbo:wikiPageRevisionID
1117767345
dbo:wikiPageWikiLink
dbr:Fair_coin dbc:Markov_models dbc:Markov_processes dbr:Geometric_series n15:Drunkard’s_walk.svg n15:Hivmodelmarkov.png dbr:Markov_chain dbr:Hadamard_product_(matrices) dbr:Snakes_and_Ladders n15:Probability_of_winning_Snakes_and_Ladders_by_turns.svg dbr:Empty_string dbr:Discrete_phase-type_distribution dbr:Absorbing_set_(random_dynamical_systems) dbr:Diagonal_matrix dbr:Identity_matrix dbr:Probability
dbo:wikiPageExternalLink
n7: n11:
owl:sameAs
dbpedia-fa:زنجیره_مارکوف_جذب‌کننده freebase:m.0hht2zf n16:4LJXS wikidata:Q4669888 yago-res:Absorbing_Markov_chain
dbp:wikiPageUsesTemplate
dbt:Main dbt:Reflist
dbo:thumbnail
n10:Drunkard’s_walk.svg?width=300
dbo:abstract
In the mathematical theory of probability, an absorbing Markov chain is a Markov chain in which every state can reach an absorbing state. An absorbing state is a state that, once entered, cannot be left. Like general Markov chains, there can be continuous-time absorbing Markov chains with an infinite state space. However, this article concentrates on the discrete-time discrete-state-space case.
gold:hypernym
dbr:Chain
prov:wasDerivedFrom
wikipedia-en:Absorbing_Markov_chain?oldid=1117767345&ns=0
dbo:wikiPageLength
11585
foaf:isPrimaryTopicOf
wikipedia-en:Absorbing_Markov_chain