Necessary and sufficient conditions for identifiability in the admixture model

02/11/2022
by   Jan van Waaij, et al.
0

We consider M SNP data from N individuals who are an admixture of K unknown ancient populations. Let Π_si be the frequency of the reference allele of individual i at SNP s. So the number of reference alleles at SNP s for a diploid individual is binomially distributed with parameters 2 and Π_si. We suppose Π_si=∑_k=1^KF_skQ_ki, where F_sk is the allele frequency of SNP s in population k and Q_ki is the proportion of population k in the ancestry of individual i. I am interested in the identifiability of F and Q, up to a relabelling of the ancient populations. Under what conditions, when Π =F^1Q^1=F^2Q^2 are F^1 and F^2 and Q^1 and Q^2 equal? I show that the anchor condition (Cabreros and Storey, 2019) on one matrix together with an independence condition on the other matrix is sufficient for identifiability. I will argue that the proof of the necessary condition in Cabreros and Storey, 2019 is incorrect, and I will provide a correct proof, which in addition does not require knowledge of the number of ancestral populations. I will also provide abstract necessary and sufficient conditions for identifiability. I will show that one cannot deviate substantially from the anchor condition without losing identifiability. Finally, I show necessary and sufficient conditions for identifiability for the non-admixed case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/23/2017

A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem

We consider the linearization problem associated with the quadratic trav...
research
07/05/2019

On Finite Exchangeability and Conditional Independence

We study the independence structure of finitely exchangeable distributio...
research
02/19/2020

Holistic Specifications for Robust Programs

Functional specifications describe what program components do: the suffi...
research
03/20/2017

Empirical Analysis of the Necessary and Sufficient Conditions of the Echo State Property

The Echo State Network (ESN) is a specific recurrent network, which has ...
research
08/14/2015

Sufficient and necessary conditions for Dynamic Programming in Valuation-Based Systems

Valuation algebras abstract a large number of formalisms for automated r...
research
09/17/2018

On Minimal Copulas under the Concordance Orde

In the present paper, we study extreme negative dependence focussing on ...
research
12/29/2013

A General Algorithm for Deciding Transportability of Experimental Results

Generalizing empirical findings to new environments, settings, or popula...

Please sign up or login with your details

Forgot password? Click here to reset