Diffusive-scaling conjecture for the detachment-counting process

About 6 years old · traced to

Consider the detachment process coupling all nn-detachment processes on one probability space. Let τ^(n)\hat\tau^{(n)}, for n=2,3,…n=2,3,\ldots, be the corresponding first detachment times, and define, for k≥1k\ge 1,

M(k):=max⁡{n: τ^(n)≤k},\mathcal{M}(k):=\max\{n:\ \hat\tau^{(n)}\le k\},

with M(k):=1\mathcal{M}(k):=1 when no two passengers have been separated. Extend M\mathcal{M} to all t≥1t\ge 1 by linear interpolation and set

M(m)(t):=M(m2t)m.\mathcal{M}^{(m)}(t):=\frac{\mathcal{M}(m^2t)}{m}.

Diffusive-scaling conjecture. The laws of the processes M(m)\mathcal{M}^{(m)}, as m→∞m\to\infty, have a limit. The process has monotone non-decreasing paths, and the conjecture asks for a process-level limit under diffusive time scaling and linear spatial scaling. The source does not specify the mode of convergence or identify the limiting law.

References

Primary source

János Engländer, “Tóth's buses and the "detachment process''”, arXiv:2512.05896 (2025).

Additional references

2 papers in this index state this conjecture (2020–2025). The statement above is taken from the most recent of them; the others are arXiv:2006.06334.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.