Indexed metadata

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

Bohan Hu, Jungang Li, Wen Sun

Source record

Source: arXiv

Published: Oct 16, 2026

arXiv: 2610.23162

Open original source ↗

Source 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 n2n^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 ρ>1ρ>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 ΓρΓ_ρ is nondecreasing and concave in ρρ, equals 1/41/4 for ρ≥4ρ\ge4, and satisfies Γρ=(log⁡ρ)/π−(log⁡ρ)2/(4π)+O((log⁡ρ)3)Γ_ρ=(\logρ)/π-(\logρ)^2/(4π) +O((\logρ)^3) as ρ↓1ρ\downarrow1. For fixed 1<ρ<41<ρ<4, we obtain MnZ=Γρn2+O(n3/2log⁡n)M_n^Z=Γ_ρn^2+O(n^{3/2}\sqrt{\log n}) almost surely. Above saturation the first correction is a random linear term; at ρ=4ρ=4, under a finite second moment assumption, the deficit Γ4n2−MnZΓ_4n^2-M_n^Z has order nlog⁡log⁡nn\log\log n in probability.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Nonconvex Carnot Limit Shapes for Branching Random Walks on the Heisenberg Group — Mathematical Frontier Network