English

Trimmed branching random walk and a free obstacle problem

Probability 2026-01-30 v1

Abstract

Consider NN particles performing random walks on the ϵ\epsilon-grid (ϵZ)d(\epsilon Z)^d, ϵ>0\epsilon>0 with branching and density-dependent selection: When one of the particles branches, a particle is removed from the most populated site. The walks are assumed to be asymptotic, as ϵ0\epsilon\to0, to diffusion processes of the form dXi(t)=b(Xi(t))dt+2dWi(t), dX_i(t)=b(X_i(t))dt+\sqrt{2}dW_i(t), for bb a given vector field. Denoting L=Δ(b)L^*=\Delta-\nabla\cdot(b\,\cdot), the hydrodynamic limit, as NN\to\infty followed by ϵ0\epsilon\to0, is characterized in terms of a parabolic free obstacle problem tu=Lu+uβ \partial_t u=L^*u+u-\beta where β\beta is a measure on Rd×[0,)R^d\times[0,\infty) supported on {(x,t):u(x,t)=u(,t)}\{(x,t):u(x,t)=|u(\cdot,t)|_\infty\}. Here, the unknowns are uu, the mass density, and β\beta, the removal measure, for which tβ(Rd×[0,t])t\mapsto\beta(R^d\times[0,t]) is prescribed. This is analogous to the well-understood relation between particle systems with spatial selection and free boundary problems, but the techniques require quite different ideas. The key ingredients of the proof include PDE uniqueness for continuous densities and a uniform-in-ϵ\epsilon estimate on modulus of continuity of prelimit densities. The work gives rise to open problems such as ``flat top'' versus ``sharp top'' solutions, which are discussed based on concrete examples.

Keywords

Cite

@article{arxiv.2601.21054,
  title  = {Trimmed branching random walk and a free obstacle problem},
  author = {Rami Atar and Leonid Mytnik and Gershon Wolansky},
  journal= {arXiv preprint arXiv:2601.21054},
  year   = {2026}
}
R2 v1 2026-07-01T09:24:41.423Z