Gaussian Markov-process limit for the birth Mallows jump count

For the birth Mallows process, let Jt={k(n2):Tkt}J_t=|\{k\leq\binom{n}{2}:T_k\leq t\}| be the number of jumps by time tt. Gaussian Markov-limit conjecture. As nn tends to infinity,

(1n[(1t)Jtnt])t[0,1)d(Gt)t[0,1),\left(\frac{1}{\sqrt{n}}\Big[(1-t)J_t-nt\Big]\right)_{t\in[0,1)}\overset{d}{\longrightarrow}(G_t)_{t\in[0,1)},

where (Gt)t[0,1)(G_t)_{t\in[0,1)} is a centred Gaussian and Markovian process. A one-time central limit theorem is stated before this conjecture, while convergence of the full process and identification of its distribution remain open.

Progress summary

Solved

A reader-posted argument, not independently checked, claims the whole evolving count has a Brownian-motion limit, beyond the original paper’s result at one time.

Corsini posed the Gaussian Markov-process conjecture in 2022 for the normalized jump-count process of the birth Mallows process. The paper explicitly leaves both process-level convergence and identification of the limiting law open.

Known results

  • Corsini (2022) proves that, for each fixed t[0,1)t\in[0,1), the normalized count converges to Normal(0,t)\operatorname{Normal}(0,t).
  • The same paper establishes the conjectured formulation with a centred Gaussian Markovian limit as an open problem.

Posted attempt

A complete functional-limit argument claims convergence in D([0,T])D([0,T]) for every T<1T<1, with standard Brownian motion as the limit, and local convergence on D([0,1))D([0,1)). The attempt is not independently verified.

Current status (as of August 2026): the fixed-time central limit theorem is established, but the process-level conjecture is supported only by an unverified complete-proof claim.

Sources
Sources & referencesView supporting material

Primary source

Benoît Corsini, “Continuous-time Mallows processes”, arXiv:2205.04967 (2022).

Solutions 1

Proof

Complete functional limit theorem. Let Jn(t)J_n(t) be the jump count of Corsini's birth Mallows process on SnS_n. For every T<1T<1,

((1t)Jn(t)ntn)0tT(Wt)0tTin D([0,T]),\left(\frac{(1-t)J_n(t)-nt}{\sqrt n}\right)_{0\le t\le T} \Longrightarrow (W_t)_{0\le t\le T} \qquad\text{in }D([0,T]),

where WW is standard Brownian motion. Thus the conjectured Gaussian Markov limit exists and is explicitly identified, with covariance E[WsWt]=min(s,t)\mathbb E[W_sW_t]=\min(s,t). The convergence also holds locally on D([0,1))D([0,1)).

The source constructs the process using independent inversion-coordinate birth processes Bj(t)B_j(t), 1jn1\le j\le n, with

Jn(t)=j=1nBj(t),Pr(Bj(t)=r)=(1t)tr1tj(0r<j).J_n(t)=\sum_{j=1}^n B_j(t),\qquad \Pr(B_j(t)=r)=\frac{(1-t)t^r}{1-t^j} \quad(0\le r<j).

The finite birth rate simplifies exactly to

qj(t,r)=r+11tjtjr1(1tr+1)(1t)(1tj).q_j(t,r) =\frac{r+1}{1-t} -\frac{j\,t^{j-r-1}(1-t^{r+1})} {(1-t)(1-t^j)}.

Indeed, because jumps have unit size, the probability current across state rr is

qj(t,r)Pr(Bj(t)=r)=ddt1+t++tr1+t++tj1,q_j(t,r)\Pr(B_j(t)=r) =-\frac{d}{dt} \frac{1+t+\cdots+t^r}{1+t+\cdots+t^{j-1}},

which gives the displayed formula directly. In particular,

0qj(t,r)r+11t.0\le q_j(t,r)\le\frac{r+1}{1-t}.

Let Y1,Y2,Y_1,Y_2,\ldots be independent Yule birth processes started at zero, with jump rate

q(t,r)=r+11t.q_\infty(t,r)=\frac{r+1}{1-t}.

Their laws are Pr(Yj(t)=r)=(1t)tr\Pr(Y_j(t)=r)=(1-t)t^r. Independently for each jj, couple BjB_j to YjY_j by accepting a Yule jump, when the current states are byb\le y, with probability

qj(t,b)(y+1)/(1t).\frac{q_j(t,b)}{(y+1)/(1-t)}.

The accepted intensity is exactly qj(t,b)q_j(t,b). Therefore Dj(t)=Yj(t)Bj(t)D_j(t)=Y_j(t)-B_j(t) is nonnegative and nondecreasing. The exact geometric means give

EDj(T)=EYj(T)EBj(T)=jTj1Tj.\mathbb ED_j(T) =\mathbb EY_j(T)-\mathbb EB_j(T) =\frac{jT^j}{1-T^j}.

Consequently,

ERT:=Ej1Dj(T)=j1jTj1TjT(1T)3<.\mathbb E R_T :=\mathbb E\sum_{j\ge1}D_j(T) =\sum_{j\ge1}\frac{jT^j}{1-T^j} \le\frac{T}{(1-T)^3}<\infty.

Hence RT<R_T<\infty almost surely, and for every nn,

sup0tTJn(t)j=1nYj(t)RT.\sup_{0\le t\le T} \left|J_n(t)-\sum_{j=1}^nY_j(t)\right| \le R_T.

In particular, the normalized path discrepancy is O(n1/2)O(n^{-1/2}) almost surely.

Now set

Xj(t)=(1t)Yj(t)t,Zn(t)=1nj=1nXj(t).X_j(t)=(1-t)Y_j(t)-t,\qquad Z_n(t)=\frac1{\sqrt n}\sum_{j=1}^nX_j(t).

The birth intensity makes XjX_j a centered square-integrable martingale:

dXj(t)=(1t)dYj(t)(Yj(t)+1)dt.dX_j(t)=(1-t)\,dY_j(t)-(Y_j(t)+1)\,dt.

Its predictable bracket is

Xjt=0t(1s)(Yj(s)+1)ds.\langle X_j\rangle_t =\int_0^t(1-s)(Y_j(s)+1)\,ds.

Since

E[(1s)(Yj(s)+1)]=1,Var((1s)(Yj(s)+1))=s,\mathbb E[(1-s)(Y_j(s)+1)]=1,\qquad \operatorname{Var}((1-s)(Y_j(s)+1))=s,

independence gives the quantitative uniform bracket bound

EsuptTZntt1n0Tsds=2T3/23n.\mathbb E\sup_{t\le T} \left|\langle Z_n\rangle_t-t\right| \le\frac1{\sqrt n}\int_0^T\sqrt s\,ds =\frac{2T^{3/2}}{3\sqrt n}.

Furthermore, suptTΔZn(t)n1/2\sup_{t\le T}|\Delta Z_n(t)|\le n^{-1/2}. The martingale functional central limit theorem therefore yields ZnWZ_n\Rightarrow W in D([0,T])D([0,T]), with WW standard Brownian motion. Finally,

suptT(1t)Jn(t)ntnZn(t)RTn0almost surely.\sup_{t\le T} \left| \frac{(1-t)J_n(t)-nt}{\sqrt n}-Z_n(t) \right| \le\frac{R_T}{\sqrt n}\longrightarrow0 \quad\text{almost surely}.

Slutsky's theorem proves the stated functional convergence for every T<1T<1.

Prior-work distinction. The Yule thinning itself appears in Adamczak–Kotowski (2025), which proves different global and local limits. The argument above uses its summable error to establish the missing Brownian functional fluctuation theorem. Dubach (2026) analyzes a different coupling and explicitly leaves extensions to regular Mallows processes and Skorohod convergence open.

Original statement: Corsini's arXiv version, Conjecture 6, §4.3; the revised author manuscript renumbers the same statement as Conjecture 5.

0 endorsements
Shivam Patel ·