Searcharxiv⌕ Search

arXiv subjects

Thomas Kriecherbauer

Publications and source records attributed to Thomas Kriecherbauer.

28 records · Page 2Linked to original sources
arXiv2016

Sixty Years of Moments for Random Matrices

This is an elementary review, aimed at non-specialists, of results that have been obtained for the limiting distribution of eigenvalues and for the operator norms of real symmetric random matrices via the method of moments. This method goes back to a remarkable argument of Eugen Wigner some sixty years ago which works best for independent matrix entries, as far as symmetry permits, that are all centered and have the same variance. We then discuss variations of this classical result for ensembles for which the variance may depend on the distance of the matrix entry to the diagonal, including in particular the case of band random matrices, and/or for which the required independence of the matrix entries is replaced by some weaker condition. This includes results on ensembles with entries from Curie-Weiss random variables or from sequences of exchangeable random variables that have been obtained quite recently.

math-ph↗
arXiv2016

Precise Deviations Results for the Maxima of Some Determinantal Point Processes: the Upper Tail

We prove precise deviations results in the sense of Cramér and Petrov for the upper tail of the distribution of the maximal value for a special class of determinantal point processes that play an important role in random matrix theory. Here we cover all three regimes of moderate, large and superlarge deviations for which we determine the leading order description of the tail probabilities. As a corollary of our results we identify the region within the regime of moderate deviations for which the limiting Tracy-Widom law still predicts the correct leading order behavior. Our proofs use that the determinantal point process is given by the Christoffel-Darboux kernel for an associated family of orthogonal polynomials. The necessary asymptotic information on this kernel has mostly been obtained in [Kriecherbauer T., Schubert K., Schüler K., Venker M., Markov Process. Related Fields 21 (2015), 639-694]. In the superlarge regime these results of do not suffice and we put stronger assumptions on the point processes. The results of the present paper and the relevant parts of [Kriecherbauer T., Schubert K., Schüler K., Venker M., Markov Process. Related Fields 21 (2015), 639-694] have been proved in the dissertation [Schüler K., Ph.D. Thesis, Universität Bayreuth, 2015].

math.PR↗
arXiv2015

Spacings - An Example for Universality in Random Matrix Theory

Universality of local eigenvalue statistics is one of the most striking phenomena of Random Matrix Theory, that also accounts for a lot of the attention that the field has attracted over the past 15 years. In this paper we focus on the empirical spacing distribution and its Kolmogorov distance from the universal limit. We describe new results, some analytical, some numerical, that are contained in [27]. A large part of the paper is devoted to explain basic definitions and facts of Random Matrix Theory, culminating in a sketch of the proof of a weak version of convergence for the empirical spacing distribution $σ_N$.

math.PR↗
arXiv2015

Edge Statistics for a Class of Repulsive Particle Systems

We study a class of interacting particle systems on $\mathbb{R}$ which was recently investigated by F. Götze and the second author [GV14]. These ensembles generalize eigenvalue ensembles of Hermitian random matrices by allowing different interactions between particles. Although these ensembles are not known to be determinantal one can use the stochastic linearization method of [GV14] to represent them as averages of determinantal ones. Our results describe the transition between universal behavior in the regime of the Tracy-Widom law and non-universal behavior for large deviations of the rightmost particle. Moreover, a detailed analysis of the transition that occurs in the regime of moderate deviations, is provided. We also compare our results with the corresponding ones obtained recently for determinantal ensembles [Sch15, EKS15]. In particular, we discuss how the averaging effects the leading order behavior in the regime of large deviations. In the analyis of the averaging procedure we use detailed asymptotic information on the behavior of Christoffel-Darboux kernels that is uniform for perturbative families of weights. Such results have been provided by K. Schubert, K. Schüler and the authors in [KSSV14].

math.PR↗
arXiv2015

Global Asymptotics for the Christoffel-Darboux Kernel of Random Matrix Theory

The investigation of universality questions for local eigenvalue statistics continues to be a driving force in the theory of Random Matrices. For Matrix Models [53] the method of orthogonal polynomials can be used and the asymptotics of the Christoffel-Darboux kernel [59] become the key for studying universality. In this paper the existing results on the CD-kernel will be extended in two directions. Firstly, in order to analyze the transition from the universal to the non-universal regime, we provide leading order asymptotics that are global rather than local. This allows e.g. to describe the moderate deviations for the largest eigenvalues of unitary ensembles ($β$ = 2), where such a transition occurs. Secondly, our asymptotics will be uniform under perturbations of the probability measure that defines the matrix ensemble. Such information is useful for the analysis of a different type of ensembles [25], which is not known to be determinantal and for which the method of orthogonal polynomials cannot be used directly. The just described applications of our results are formulated in this paper but will be proved elsewhere. As a byproduct of our analysis we derive first order corrections for the 1-point correlation functions of unitary ensembles in the bulk. Our proofs are based on the nonlinear steepest descent method [20]. They follow closely [17] and incorporate improvements introduced in [36, 64]. The presentation is self-contained except for a number of general facts from Random Matrix theory and from the theory of singular integral operators.

math.PR↗
arXiv2010

A pedestrian's view on interacting particle systems, KPZ universality, and random matrices

These notes are based on lectures delivered by the authors at a Langeoog seminar of SFB/TR12 "Symmetries and universality in mesoscopic systems" to a mixed audience of mathematicians and theoretical physicists. After a brief outline of the basic physical concepts of equilibrium and nonequilibrium states, the one-dimensional simple exclusion process is introduced as a paradigmatic nonequilibrium interacting particle system. The stationary measure on the ring is derived and the idea of the hydrodynamic limit is sketched. We then introduce the phenomenological Kardar-Parisi-Zhang (KPZ) equation and explain the associated universality conjecture for surface fluctuations in growth models. This is followed by a detailed exposition of a seminal paper of Johansson that relates the current fluctuations of the totally asymmetric simple exclusion process (TASEP) to the Tracy-Widom distribution of random matrix theory. The implications of this result are discussed within the framework of the KPZ conjecture.

cond-mat.stat-mech↗
arXiv2006

Universality for orthogonal and symplectic Laguerre-type ensembles

We give a proof of the Universality Conjecture for orthogonal (beta=1) and symplectic (beta=4) random matrix ensembles of Laguerre-type in the bulk of the spectrum as well as at the hard and soft spectral edges. Our results are stated precisely in the Introduction (Theorems 1.1, 1.4, 1.6 and Corollaries 1.2, 1.5, 1.7). They concern the appropriately rescaled kernels K_{n,beta}, correlation and cluster functions, gap probabilities and the distributions of the largest and smallest eigenvalues. Corresponding results for unitary (beta=2) Laguerre-type ensembles have been proved by the fourth author in [23]. The varying weight case at the hard spectral edge was analyzed in [13] for beta=2: In this paper we do not consider varying weights. Our proof follows closely the work of the first two authors who showed in [7], [8] analogous results for Hermite-type ensembles. As in [7], [8] we use the version of the orthogonal polynomial method presented in [25], [22] to analyze the local eigenvalue statistics. The necessary asymptotic information on the Laguerre-type orthogonal polynomials is taken from [23].

math-ph↗
arXiv2005

On the existence of quasi-periodic lattice oscillations

We construct multi-phase travelling waves which are periodic in time and quasi-periodic in the spatial variable for infinite nonlinear chains with nearest neighbor interactions. The main difficulty in the construction is a small divisor problem. We prove a KAM-type theorem for an infinite dimensional system following the approach of W. Craig and C. E Wayne which was further developed by J. Bourgain.

math.CA↗
arXiv2002

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

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.

math.CA↗