Nearly completely decomposable Markov chain¶

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.

Version: v1 · 2026-09-28 · History
Domain-specific #: 10932
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Probability Theory, Markov Chains → Mathematics

Core Idea¶

Nearly completely decomposable Markov chain is treated here as the recurring cross_domain_models_structures_representations identity summarized by this source-grounded definition: 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.

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. Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else.

is nearly completely decomposable if ε is small (say 0.1). Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. \frac{1}{2} & \frac{1}{2} & 0 & 0 \.

For Nearly completely decomposable Markov chain, the abstraction is narrower than the article's general subject matter: a positive case must preserve 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. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in cross_domain_models_structures_representations, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster.
Constitutive relation — Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else.
Operating condition — \frac{1}{2} & \frac{1}{2} & 0 & 0 \.
Recognition evidence — 0 & 0 & \frac{1}{2} & \frac{1}{2} \.
Admissible variation — \frac{1}{2} & 0 & \frac{1}{2} & 0 \.
Characteristic consequence — 0 & -\frac{1}{2} & 0 & \frac{1}{2} \.
Failure boundary — is nearly completely decomposable if ε is small (say 0.1).

What It Is Not¶

Not the whole field of cross_domain_models_structures_representations. The node requires the specific identity stated by 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.
Not an over-broad reading. Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster.
Not an over-broad reading. Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else.
Not an over-broad reading. \frac{1}{2} & \frac{1}{2} & 0 & 0 \.
Not automatically Transition-rate matrix. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Nearly completely decomposable Markov chain applies literally inside cross_domain_models_structures_representations wherever the source-defined carrier and relation can be established. Its documented habitats include:

Stationary distribution algorithms. Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster.
Definition. Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else.
A Markov chain with transition matrix. \frac{1}{2} & \frac{1}{2} & 0 & 0 \.
A Markov chain with transition matrix. 0 & 0 & \frac{1}{2} & \frac{1}{2} \.
A Markov chain with transition matrix. \frac{1}{2} & 0 & \frac{1}{2} & 0 \.
A Markov chain with transition matrix. 0 & -\frac{1}{2} & 0 & \frac{1}{2} \.

Outside cross_domain_models_structures_representations, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Theory or should be marked as analogy.

Clarity¶

A clear use of Nearly completely decomposable Markov chain names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is 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. The strongest recognition evidence in the frozen account is: 0 & 0 & \frac{1}{2} & \frac{1}{2} \. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Nearly completely decomposable Markov chain compresses multiple cross_domain_models_structures_representations details into a stable diagnostic relation. The source shows both the central mechanism—ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else.—and the practical consequence—0 & -\frac{1}{2} & 0 & \frac{1}{2} \. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the cross_domain_models_structures_representations entities to which the claim applies.
State the relation. Use the source-grounded identity: 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.
Check operation and conditions. \frac{1}{2} & \frac{1}{2} & 0 & 0 \.
Demand recognition evidence. 0 & 0 & \frac{1}{2} & \frac{1}{2} \.
Test variation. Change an implementation or setting while preserving \frac{1}{2} & 0 & \frac{1}{2} & 0 \.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Theory.

Knowledge Transfer¶

Within the home domain. Knowledge about Nearly completely decomposable Markov chain transfers literally when a new case preserves the same carrier type, relation, and recognition test. Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else.

Beyond the home domain. No canonical parent is asserted for Nearly completely decomposable Markov chain. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → 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; recognition evidence → 0 & 0 & \frac{1}{2} & \frac{1}{2} \

Applied / In Practice¶

Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Definition; invariant → 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; boundary → the case exits the class when special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster

Structural Tensions¶

T1 — Stable identity versus admissible variation. Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. \frac{1}{2} & \frac{1}{2} & 0 & 0 \. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. 0 & 0 & \frac{1}{2} & \frac{1}{2} \. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Nearly completely decomposable Markov chain literally, co-instantiate Theory, or only resemble it?

T6 — Autonomy versus reduction. Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Nearly completely decomposable Markov chain distinguish that the broader parent Theory leaves together?

Structural–Framed Character¶

Nearly completely decomposable Markov chain is mixed or framed-leaning. Its structural side is the repeatable organization summarized by 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. Its framed side is the cross_domain_models_structures_representations vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: \frac{1}{2} & \frac{1}{2} & 0 & 0 \. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Theory. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. 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. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else. It further constrains recognition and variation through: \frac{1}{2} & \frac{1}{2} & 0 & 0 \. 0 & 0 & \frac{1}{2} & \frac{1}{2} \.

What is domain-bound. cross domain models structures representations supplies the operative entities, technical vocabulary, warrants, and exceptions that make Nearly completely decomposable Markov chain literal. Its documented scope includes the condition that Special-purpose iterative algorithms have been designed for NCD Markov chains though the multi–level algorithm, a general purpose algorithm, has been shown experimentally to be competitive and in some cases significantly faster. Another bounded application condition is that Ando and Fisher define a completely decomposable matrix as one where "an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and zeros everywhere else." A nearly completely decomposable matrix is one where an identical rearrangement of rows and columns leaves a set of square submatrices on the principal diagonal and small nonzeros everywhere else. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—\frac{1}{2} & 0 & \frac{1}{2} & 0 \.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Markov Process.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Nearly completely decomposable Markov chain. The reviewed identity is: 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. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Nearly completely decomposable Markov chain Domain-specific

Parents (1) — more general patterns this builds on

Nearly completely decomposable Markov chain is a kind of Markov Process Prime

A nearly decomposable Markov chain is a Markov process with fast within-block and slow between-block transition structure.

Hierarchy paths (4) — routes to 4 parentless roots

Nearly completely decomposable Markov chain → Markov Process → Stochastic Process

Show alternative paths (3)

Neighborhood in Abstraction Space¶

Nearly completely decomposable Markov chain sits in a sparse region of the domain-specific corpus (61^st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Markov Chains & Probabilistic Computation (6 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Theory. The parent omits the specialist differentia. Tell: Can the case establish 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?
Transition-rate matrix. The infinitesimal generator of a finite-state continuous-time Markov chain, with nonnegative off-diagonal jump rates and rows summing to zero. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Doubly stochastic matrix. A square nonnegative matrix whose every row and column sums to one, equivalently a convex combination of permutation matrices and a point in the Birkhoff polytope. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Indecomposable distribution. An indecomposable probability distribution cannot be represented as the convolution of two non-degenerate probability distributions, making it irreducible with respect to addition of independent random variables. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Nearly completely decomposable Markov chain remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside cross_domain_models_structures_representations lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Theory?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Nearly_completely_decomposable_Markov_chain (revision 1167025714).
Preserved source candidate: https://archive.org/details/discretetimemark00ying_757/page/n21
Preserved source candidate: https://archive.org/details/discretetimemark00ying_757
Preserved source candidate: https://apps.dtic.mil/sti/pdfs/ADA284423.pdf
Preserved source candidate: https://web.archive.org/web/20130408131233/http://www.dtic.mil/cgi-bin/GetTRDoc?Location=U2&doc=GetTRDoc.pdf&AD=ADA284423

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.