This HTML5 document contains 45 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/
n10https://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/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
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:NCD
dbo:wikiPageWikiLink
dbr:Nearly_completely_decomposable_Markov_chain
dbo:wikiPageDisambiguates
dbr:Nearly_completely_decomposable_Markov_chain
Subject Item
dbr:Nearly_completely_decomposable_Markov_chain
rdf:type
yago:Procedure101023820 yago:WikicatMarkovProcesses yago:Abstraction100002137 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Activity100407535 dbo:Company yago:Event100029378 yago:Act100030358
rdfs:label
Nearly completely decomposable Markov chain
rdfs:comment
In probability theory, a nearly completely decomposable (NCD) Markov chain is a Markov chain where the state-space can be partitioned in such a way that movement within a partition occurs much more frequently than movement between partitions. Particularly efficient algorithms exist to compute the stationary distribution of Markov chains with this property.
dcterms:subject
dbc:Markov_processes
dbo:wikiPageID
33985557
dbo:wikiPageRevisionID
1091158606
dbo:wikiPageWikiLink
dbr:Stochastic_matrix dbr:Principal_diagonal dbr:Lumpability dbr:Submatrices dbr:Probability_theory dbr:Albert_Ando dbc:Markov_processes dbr:Stationary_distribution dbr:Franklin_M._Fisher dbr:Markov_chain
owl:sameAs
wikidata:Q6984448 n10:4sNZk freebase:m.0hnf3tw yago-res:Nearly_completely_decomposable_Markov_chain
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
In probability theory, a nearly completely decomposable (NCD) Markov chain is a Markov chain where the state-space can be partitioned in such a way that movement within a partition occurs much more frequently than movement between partitions. Particularly efficient algorithms exist to compute the stationary distribution of Markov chains with this property.
gold:hypernym
dbr:Chain
prov:wasDerivedFrom
wikipedia-en:Nearly_completely_decomposable_Markov_chain?oldid=1091158606&ns=0
dbo:wikiPageLength
4742
foaf:isPrimaryTopicOf
wikipedia-en:Nearly_completely_decomposable_Markov_chain
Subject Item
dbr:List_of_things_named_after_Andrey_Markov
dbo:wikiPageWikiLink
dbr:Nearly_completely_decomposable_Markov_chain
Subject Item
dbr:Lumpability
dbo:wikiPageWikiLink
dbr:Nearly_completely_decomposable_Markov_chain
Subject Item
dbr:Nearly_completely_decomposable
dbo:wikiPageWikiLink
dbr:Nearly_completely_decomposable_Markov_chain
dbo:wikiPageRedirects
dbr:Nearly_completely_decomposable_Markov_chain
Subject Item
dbr:Nearly_completely_decomposable_matrix
dbo:wikiPageWikiLink
dbr:Nearly_completely_decomposable_Markov_chain
dbo:wikiPageRedirects
dbr:Nearly_completely_decomposable_Markov_chain
Subject Item
dbr:NCD_Markov_chain
dbo:wikiPageWikiLink
dbr:Nearly_completely_decomposable_Markov_chain
dbo:wikiPageRedirects
dbr:Nearly_completely_decomposable_Markov_chain
Subject Item
wikipedia-en:Nearly_completely_decomposable_Markov_chain
foaf:primaryTopic
dbr:Nearly_completely_decomposable_Markov_chain