Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nonconvex Carnot Limit Shapes for Branching Random Walks on the Heisenberg Group

Published 16 Oct 2026 in math.PR | (2610.23162v1)

Abstract: We study a supercritical branching random walk on the discrete Heisenberg group driven by the four standard horizontal generators. Horizontal position has scale nn, whereas the central coordinate records discrete area and has scale n<sup>2n<sup>2. On the Galton-Watson survival event, we prove almost sure Hausdorff convergence, under Carnot scaling, of both the rescaled particle positions and the collections of enhanced ancestral paths. The path limit consists of area lifts of horizontal paths ωω satisfying Jt(ω)≤tlog⁡ρJ_t(ω)\le t\logρ for every t∈[0,1]t\in[0,1], where ρρ is the offspring mean. In contrast to the classical Euclidean case, the deterministic limit shape is nonconvex for every $ρ&gt;1$. We identify its horizontal projection and interval vertical fibers, determine the saturated shape for ρ≥4ρ\ge4, and characterize the origin fiber below saturation by Wulff duality. A hyperbolic representation gives an elliptic integral formula for the Wulff area. The maximal central coordinate Γ<em>ρΓ<em>ρ is nondecreasing and concave in ρρ, equals $1/4$ for ρ≥4ρ\ge4, and satisfies Γ</em>ρ=(log⁡ρ)/π−(log⁡ρ)<sup>2/(4π)</sup>+O((log⁡ρ)<sup>3)Γ</em>ρ=(\logρ)/π-(\logρ)<sup>2/(4π)</sup> +O((\logρ)<sup>3) as ρ↓1ρ\downarrow1. For fixed $1<ρ<4$, we obtain Mn<sup>Z=Γρn<sup>2+O(n<sup>3/2log⁡</sup></sup></sup>n)M_n<sup>Z=Γ_ρn<sup>2+O(n<sup>{3/2}\sqrt{\log</sup></sup></sup> n}) almost surely. Above saturation the first correction is a random linear term; at ρ=4ρ=4, under a finite second moment assumption, the deficit Γ4n<sup>2−Mn<sup>ZΓ_4n<sup>2-M_n<sup>Z has order nlog⁡log⁡nn\log\log n in probability.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.