Delphi.science

Critical trees are neither too short nor too fat

Source: github.com/igor-kortchemski/critical-trees-height-width/tre…

Igor Kortchemski

Palomar Registrypalomar/PALOMAR-2026-11-07-000010Nov 7, 2026math.PRscore 0

Lean 4 proofs of the main results of Addario-Berry, Donderwinkel and Kortchemski, "Critical trees are neither too short nor too fat" (arXiv:2311.06163). For every critical offspring law, the height of the size-conditioned Bienaymé tree divided by log n tends to infinity and its width divided by n tends to zero in probability, along admissible sizes. These bounds are sharp: for every function f tending to infinity, a single critical offspring law has limsup P(height n/f(n)) = 1. For critical offspring laws in the local domain of attraction of the asymmetric Cauchy law (mu_n = L(n)/n^2 with L…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-07-000010
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-07-000010/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-07-000010/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'