The KPZ fixed point
By K. Matetski, Jeremy Quastel, Daniel Remenik. Acta Mathematica, 2016
190 citations recorded by the source corpus.
An explicit Fredholm determinant formula is derived for the multipoint distribution of the height function of the totally asymmetric simple exclusion process with arbitrary initial condition. The method is by solving the biorthogonal ensemble/non-intersecting path representation found by [Sas05; BFPS07]. The resulting kernel involves transition probabilities of a random walk forced to hit a curve defined by the initial data. In the KPZ 1:2:3 scaling limit the formula leads in a transparent way to a Fredholm determinant formula, in terms of analogous kernels based on Brownian motion, for the transition probabilities of the scaling invariant Markov process at the centre of the KPZ universality class. The formula readily reproduces known special self-similar solutions such as the Airy$_1$ and Airy$_2$ processes. The invariant Markov process takes values in real valued functions which look locally like Brownian motion, and is H\"older $1/3-$ in time.
Subfields: Artificial Intelligence, Mathematical Physics, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/52345d37cb4b7868470740518d69e7a9964e7d2e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Mathematical Physics
- Janosch Ortmann
- Duncan Dauvergne
- B'alint Vir'ag
- L. Erdős
- Rostislav I. Grigorchuk
- Horng-Tzer Yau
- Volodymyr V. Nekrashevych
- Sylvia Serfaty
In Statistics and Probability
- Janosch Ortmann
- Duncan Dauvergne
- B'alint Vir'ag
- Manjunath Krishnapur
- L. Erdős
- Nicolas Curien
- Horng-Tzer Yau
- Terence Tao
Citations in the corpus
- The directed landscape (2018, background): “The key observation for our proof is a combinatorial fact about the RSK correspondence, whose application to Brownian paths was developed in O’Connell and Yor (2002). The continuous RSK correspondence maps an n-tuple of continuous functions f : [0, 1] × {1, .”