title: Laplacian eigenfunctions learn population structure.
abstract: Principal components analysis has been used for decades to summarize genetic variation across geographic regions and to infer population migration history. More recently, with the advent of genome-wide association studies of complex traits, it has become a commonly-used tool for detection and correction of confounding due to population structure. However, principal components are generally sensitive to outliers. Recently there has also been concern about its interpretation. Motivated from geometric learning, we describe a method based on spectral graph theory. Regarding each study subject as a node with suitably defined weights for its edges to close neighbors, one can form a weighted graph. We suggest using the spectrum of the associated graph Laplacian operator, namely, Laplacian eigenfunctions, to infer population structure. In simulations and real data on a ring species of birds, Laplacian eigenfunctions reveal more meaningful and less noisy structure of the underlying population, compared with principal components. The proposed approach is simple and computationally fast. It is expected to become a promising and basic method for population genetics and disease association studies.
authors: Department of Radiology, The University of Chicago, Chicago, Illinois, United States of America. junzhang@galton.uchicago.edu
authors: Jun
authors: J
authors: Zhang
authors: Partha
authors: P
authors: Niyogi
authors: Mary Sara
authors: MS
authors: McPeek
mesh_terms: D000818:Animals; D003198:Computer Simulation; D030541:Databases, Genetic; D046109:Passeriformes / Q000235:genetics*; D011157:Population Dynamics; D025341:Principal Component Analysis