2,032 research outputs found

    Uniform Asymptotics for Polynomials Orthogonal With Respect to a General Class of Discrete Weights and Universality Results for Associated Ensembles: Announcement of Results

    Full text link
    We compute the pointwise asymptotics of orthogonal polynomials with respect to a general class of pure point measures supported on finite sets as both the number of nodes of the measure and also the degree of the orthogonal polynomials become large. The class of orthogonal polynomials we consider includes as special cases the Krawtchouk and Hahn classical discrete orthogonal polynomials, but is far more general. In particular, we consider nodes that are not necessarily equally spaced. The asymptotic results are given with error bound for all points in the complex plane except for a finite union of discs of arbitrarily small but fixed radii. These exceptional discs are the neighborhoods of the so-called band edges of the associated equilibrium measure. As applications, we prove universality results for correlation functions of a general class of discrete orthogonal polynomial ensembles, and in particular we deduce asymptotic formulae with error bound for certain statistics relevant in the random tiling of a hexagon with rhombus-shaped tiles. The discrete orthogonal polynomials are characterized in terms of a a Riemann-Hilbert problem formulated for a meromorphic matrix with certain pole conditions. By extending the methods of [17, 22], we suggest a general and unifying approach to handle Riemann-Hilbert problems in the situation when poles of the unknown matrix are accumulating on some set in the asymptotic limit of interest.Comment: 28 pages, 7 figure

    Exponential torsion growth for random 3-manifolds

    No full text
    We show that a random 3-manifold with positive first Betti number admits a tower of cyclic covers with exponential torsion growth

    Dynamics of a tagged particle in the asymmetric exclusion process with the step initial condition

    Full text link
    The one-dimensional totally asymmetric simple exclusion process (TASEP) is considered. We study the time evolution property of a tagged particle in TASEP with the step-type initial condition. Calculated is the multi-time joint distribution function of its position. Using the relation of the dynamics of TASEP to the Schur process, we show that the function is represented as the Fredholm determinant. We also study the scaling limit. The universality of the largest eigenvalue in the random matrix theory is realized in the limit. When the hopping rates of all particles are the same, it is found that the joint distribution function converges to that of the Airy process after the time at which the particle begins to move. On the other hand, when there are several particles with small hopping rate in front of a tagged particle, the limiting process changes at a certain time from the Airy process to the process of the largest eigenvalue in the Hermitian multi-matrix model with external sources.Comment: 48 pages, 8 figure

    An Anisotropic Ballistic Deposition Model with Links to the Ulam Problem and the Tracy-Widom Distribution

    Full text link
    We compute exactly the asymptotic distribution of scaled height in a (1+1)--dimensional anisotropic ballistic deposition model by mapping it to the Ulam problem of finding the longest nondecreasing subsequence in a random sequence of integers. Using the known results for the Ulam problem, we show that the scaled height in our model has the Tracy-Widom distribution appearing in the theory of random matrices near the edges of the spectrum. Our result supports the hypothesis that various growth models in (1+1)(1+1) dimensions that belong to the Kardar-Parisi-Zhang universality class perhaps all share the same universal Tracy-Widom distribution for the suitably scaled height variables.Comment: 5 pages Revtex, 3 .eps figures included, new references adde

    Genetic Classification of Populations using Supervised Learning

    Get PDF
    There are many instances in genetics in which we wish to determine whether two candidate populations are distinguishable on the basis of their genetic structure. Examples include populations which are geographically separated, case--control studies and quality control (when participants in a study have been genotyped at different laboratories). This latter application is of particular importance in the era of large scale genome wide association studies, when collections of individuals genotyped at different locations are being merged to provide increased power. The traditional method for detecting structure within a population is some form of exploratory technique such as principal components analysis. Such methods, which do not utilise our prior knowledge of the membership of the candidate populations. are termed \emph{unsupervised}. Supervised methods, on the other hand are able to utilise this prior knowledge when it is available. In this paper we demonstrate that in such cases modern supervised approaches are a more appropriate tool for detecting genetic differences between populations. We apply two such methods, (neural networks and support vector machines) to the classification of three populations (two from Scotland and one from Bulgaria). The sensitivity exhibited by both these methods is considerably higher than that attained by principal components analysis and in fact comfortably exceeds a recently conjectured theoretical limit on the sensitivity of unsupervised methods. In particular, our methods can distinguish between the two Scottish populations, where principal components analysis cannot. We suggest, on the basis of our results that a supervised learning approach should be the method of choice when classifying individuals into pre-defined populations, particularly in quality control for large scale genome wide association studies.Comment: Accepted PLOS On
    • 

    corecore