Hostname: page-component-848d4c4894-x5gtn Total loading time: 0 Render date: 2024-06-07T04:58:28.402Z Has data issue: false hasContentIssue false

The consistency of the posterior probability of linkage

Published online by Cambridge University Press:  20 February 2001

K. WANG
Affiliation:
Department of Biostatistics, The University of Iowa, Iowa City, Iowa, USA
J. HUANG
Affiliation:
Department of Statistics and Actuarial Science, The University of Iowa, Iowa City, Iowa, USA
V. J. VIELAND
Affiliation:
Department of Biostatistics, The University of Iowa, Iowa City, Iowa, USA Department of Psychiatry, The University of Iowa, Iowa City, Iowa, USA
Get access

Abstract

When searching for trait loci along the genome, properly incorporating prior genomic information into the analysis will almost certainly increase the chance of success. Recently, we devised a method that utilizes such prior information in the mapping of trait genes for complex disorders (Vieland, 1998; Wang et al. 1999; Vieland et al. 2000). This method uses the posterior probability of linkage (PPL) based on the admixture model as a measure of linkage information. In this paper, we study the consistency of the PPL. It is shown that, as the number of pedigrees increases, the PPL converges in probability to 1 when there is linkage between the marker and a trait locus, and converges to 0 otherwise. This conclusion is shown to be true for general pedigrees and trait models, even when the likelihood functions are based on misspecified trait models. As part of the effort to prove this conclusion, it is shown that when there is no linkage, the maximum likelihood estimator of the recombination fraction in the admixture model is asymptotically 0.5, even when the admixture model misrepresents the true model.

Type
Research Article
Copyright
University College London 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)