uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Asymptotic geometry of discrete interlaced patterns: Part I
Royal Inst Technol KTH, Dept Math, Stockholm, Sweden..
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory.
2015 (English)In: International Journal of Mathematics, ISSN 0129-167X, Vol. 26, no 11, 1550093Article in journal (Refereed) Published
Abstract [en]

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 behavior 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 parameterizations 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 behavior of the roots of a function related to the correlation kernel. This paper should be regarded as a companion piece to the paper [E. Duse and A. Metcalfe, Asymptotic geometry of discrete interlaced patterns: Part II, in preparation], in which we resolve some of the remaining issues. Both of these papers serve as background material for the papers [E. Duse and A. Metcalfe, Universal edge fluctuations of discrete interlaced particle systems, in preparation; E. Duse and K. Johansson and A. Metcalfe, Cusp Airy process of discrete interlaced particle systems, in preparation], in which we examine the edge asymptotic behavior.

Place, publisher, year, edition, pages
2015. Vol. 26, no 11, 1550093
Keyword [en]
Random tilings, random matrices, determinantal point processing, universality
National Category
Geometry
Identifiers
URN: urn:nbn:se:uu:diva-267321DOI: 10.1142/S0129167X15500937ISI: 000363419500007OAI: oai:DiVA.org:uu-267321DiVA: diva2:873674
Funder
Knut and Alice Wallenberg Foundation, KAW 2010.0063
Available from: 2015-11-24 Created: 2015-11-20 Last updated: 2017-12-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Metcalfe, Anthony

Search in DiVA

By author/editor
Metcalfe, Anthony
By organisation
Analysis and Probability Theory
In the same journal
International Journal of Mathematics
Geometry

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 514 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf