Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

A scheme for constructing an irreducible Markov chain for pedigree data.

Biometrics - 1 Mar 1995

Lin S

Abstract excerpt

Estimating probabilities on a pedigree by dependent samples, namely realizations of a Markov chain, has been explored as an alternative method when exact computation is not feasible. If the transition kernel of the Markov chain is aperiodic and irreducible, convergence of the estimates to the true probabilities is guaranteed by the ergodic theorem. However, reducibility is a potential problem for genetic pedigree...

Topics

ABO Blood-Group System
Child
Genotype
Humans
Markov Chains
Models, Genetic
Models, Statistical
Pedigree
Probability

Source

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Identifiers

PMID: 7766786

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 29 Aug 2026. Prepared record publication-7766786-2026-08-29.1. Manifest publication-graph-cohort-2026-08-29.1.

Source receipt: PubMed via Helena Literature Corpus, retrieved 29 Aug 2026.

Community interpretation

Discuss the evidence

Ask a question, add context or challenge an interpretation. Community activity is separate from scientific evidence strength.

0

discussions

0

replies

Citations encouraged

Claims remain attributable.

No discussion yet

Be the first to add a careful, cited interpretation.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 8 closest

A scheme for constructing an irreducible Markov chain for pedigree data.PMID 7766786Read ↗

Achieving irreducibility of the Markov chain Monte Carlo method applied to pedigree data.Semantic proximity Read ↗

On the irreducibility of a Markov chain defined on a space of genotype configurations by a sampling scheme.Semantic proximity Read ↗

Problems with determination of noncommunicating classes for Monte Carlo Markov chain applications in pedigree analysis.Semantic proximity Read ↗

Finding noncommunicating sets for Markov chain Monte Carlo estimations on pedigrees.Semantic proximity Read ↗

Irreducibility and efficiency of ESIP to sample marker genotypes in large pedigrees with loops.Semantic proximity Read ↗

Sampling genotypes in large pedigrees with loops.Semantic proximity Read ↗

A Markov chain Monte Carlo strategy for sampling from the joint posterior distribution of pedigrees and population parameters under a Fisher-Wright model with partial selfing.Semantic proximity Read ↗

The number of genotypic assignments on a genealogy. I. The method and simple examples.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.