Asymptotic geometry of discrete interlaced patterns: Part I
From MaRDI portal
Publication:3462611
DOI10.1142/S0129167X15500937zbMATH Open1359.60021arXiv1412.6653OpenAlexW2963862285MaRDI QIDQ3462611FDOQ3462611
Publication date: 15 January 2016
Published in: International Journal of Mathematics (Search for Journal in Brave)
Abstract: A discrete Gelfand-Tsetlin pattern is a configuration of particles in Z^2. The particles are arranged in a finite number of consecutive rows, numbered from the bottom. There is one particle on the first row, two particles on the second row, three particles on the third row, etc, and particles on adjacent rows satisfy an interlacing constraint. We consider the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of a fixed size where the particles on the top row are in deterministic positions. This measure arises naturally as an equivalent description of the uniform probability measure on the set of all tilings of certain polygons with lozenges. We prove a determinantal structure, and calculate the correlation kernel. We consider the asymptotic behaviour of the system as the size increases under the assumption that the empirical distribution of the deterministic particles on the top row converges weakly. We consider the asymptotic `shape' of such systems. We provide parameterisations of the asymptotic boundaries and investigate the local geometric properties of the resulting curves. We show that the boundary can be partitioned into natural sections which are determined by the behaviour of the roots of a function related to the correlation kernel. This paper should be regarded as a companion piece to the upcoming paper, [4], in which we resolve some of the remaining issues. Both of these papers serve as background material for the upcoming papers, [5] and [6], in which we examine the edge asymptotic behaviour.
Full work available at URL: https://arxiv.org/abs/1412.6653
Random matrices (probabilistic aspects) (60B20) Geometric probability and stochastic geometry (60D05) Combinatorial probability (60C05) Combinatorial aspects of tessellation and tiling problems (05B45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local statistics of lattice dimers
- Scale invariance of the PNG droplet and the Airy process
- The arctic circle boundary and the Airy process
- Discrete polynuclear growth and determinantal processes
- Limit shapes and the complex Burgers equation
- Dimers and amoebae
- Discrete Orthogonal Polynomials. (AM-164): Asymptotics and Applications (AM-164)
- Course 1 Random matrices and determinantal processes
- Dyson's Brownian motions, intertwining and interlacing
- Asymptotics of random lozenge tilings via Gelfand-Tsetlin schemes
- Orbit measures, random matrix theory and interlaced determinantal processes
- Universality properties of Gelfand-Tsetlin patterns
Cited In (22)
- Lozenge tilings and Hurwitz numbers
- Fourier transform on high-dimensional unitary groups with applications to random tilings
- Gelfand-Tsetlin polytopes and random contractions away from the limiting shape
- Bulk universality for random lozenge tilings near straight boundaries and for tensor products
- Local limits of lozenge tilings are stable under bounded boundary height perturbations
- Double interlacing in random tiling models
- Random sorting networks: local statistics via random matrix laws
- Universal edge fluctuations of discrete interlaced particle systems
- Dynamical loop equation
- Universality of local statistics for noncolliding random walks
- Lozenge tilings of hexagons with cuts and asymptotic fluctuations: a new universality class
- A tangent method derivation of the arctic curve for q-weighted paths with arbitrary starting points
- Concavity analysis of the tangent method
- Arctic curves for paths with arbitrary starting points: a tangent method approach
- Asymptotics of noncolliding q-exchangeable random walks
- A periodic hexagon tiling model and non-Hermitian orthogonal polynomials
- Tangent method for the arctic curve arising from freezing boundaries
- Asymptotic geometry of discrete interlaced pattern. II
- Limit shape and height fluctuations of random perfect matchings on square-hexagon lattices
- Fluctuations of particle systems determined by Schur generating functions
- Tilings of non-convex polygons, skew-Young tableaux and determinantal processes
- Asymptotics of random domino tilings of rectangular Aztec diamonds
This page was built for publication: Asymptotic geometry of discrete interlaced patterns: Part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462611)