pith. sign in

arxiv: 1608.06384 · v1 · pith:PLKLM4JZnew · submitted 2016-08-23 · 🧮 math.PR

Hard-edge asymptotics of the Jacobi growth process

classification 🧮 math.PR
keywords betaalphaasymptoticshard-edgejacobikerneldependentedge
0
0 comments X
read the original abstract

We introduce a two parameter ($\alpha, \beta>-1$) family of interacting particle systems with determinantal correlation kernels expressible in terms of Jacobi polynomials $\{ P^{(\alpha, \beta)}_k \}_{k \geq 0}$. The family includes previously discovered Plancherel measures for the infinite-dimensional orthogonal and symplectic groups. The construction uses certain BC-type orthogonal polynomials which generalize the characters of these groups. The local asymptotics near the hard edge where one expects distinguishing behavior yields the multi-time $(\alpha, \beta)$-dependent discrete Jacobi kernel and the multi-time $\beta$-dependent hard-edge Pearcey kernel. For nonnegative integer values of $\beta$, the hard-edge Pearcey kernel had previously appeared in the asymptotics of non-intersecting squared Bessel paths at the hard edge.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.