Delphi.science

Uniform attachment with freezing: local limits and geometric Bienaymé trees

Source: github.com/igor-kortchemski/uniform-attachment-with-freezin…

Igor Kortchemski

Palomar Registrypalomar/PALOMAR-2026-11-04-000008Nov 4, 2026math.PRscore 0

Lean proofs of the local-limit criterion and geometric Bienaymé limit for uniform attachment trees with freezing. The selected conclusions characterize convergence by the divergence of the freezing reciprocal sum, identify the common limit for approximating schedules, and identify the iid-sign limit as a Bienaymé tree with offspring probabilities (1-p)p^k for 0 <= p < 1. The compared carrier is chronological; the full ambient transport is proved in the library outside these selected targets. This entry covers T01–T02 and shares its proof repository with the other result groups.

RepositoryJSON

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-04-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-04-000008/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-04-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'