Papers
Topics
Authors
Recent
Search
2000 character limit reached

The k-tacnode process

Published 21 Sep 2017 in math.PR, math-ph, math.CA, and math.MP | (1709.07141v1)

Abstract: The tacnode process is a universal behavior arising in nonintersecting particle systems and tiling problems. For Dyson Brownian bridges, the tacnode process describes the grazing collision of two packets of walkers. We consider such a Dyson sea on the unit circle with drift. For any integer k, we show that an appropriate double scaling of the drift and return time leads to a generalization of the tacnode process in which k particles are expected to wrap around the circle. We derive winding number probabilities and an expression for the correlation kernel in terms of functions related to the generalized Hastings-McLeod solutions to the inhomogeneous Painleve-II equation. The method of proof is asymptotic analysis of discrete orthogonal polynomials with a complex weight.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.