ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (\mathpzcX(t))t=0,1,…(\mathpzc{X}(t))_{t=0,1,\dots} be the particle process arising from the shuffling algorithm for random tilings of the Aztec diamond, and let (X(t))t≥0(\mathbf{X}(t))_{t\geq 0} denote Warren's process of interlacing Dyson Brownian motions. For the component process Xn(t)=(X1n(t),…,Xnn(t))X^n(t)=(X^n_1(t),\dots,X^n_n(t)), define

X~in(t)=Xin(Nt)−12Nt12N\tilde X^n_i(t)=\frac{X^n_i(Nt)-\frac{1}{2}Nt}{\frac{1}{2}\sqrt{N}}

with linear interpolation for non-integer values of NtNt. Nordenstam's scaling-limit conjecture. Consider the rescaled process \mathpzcX~(t)\tilde{\mathpzc{X}}(t). It converges to Warren's process X(t)\mathbf{X}(t) as N→∞N\rightarrow\infty, in the sense of convergence of finite-dimensional distributions.

This conjecture proposes that Warren's continuous interlacing Brownian-motion process is the scaling limit of the discrete particle dynamics underlying the Aztec-diamond shuffling algorithm. The paper proves the corresponding convergence for each fixed component to Dyson Brownian motion and establishes further partial results supporting the full-process convergence.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.