arXiv (All)
open access
Uniform integrability of the distance to the nearest leaf in random trees
We study the distance from the root to the nearest leaf, the analogous quantity for a uniformly chosen vertex, and its protection number, in size-conditioned simply generated trees. We prove a uniform exponential tail bound for each of these quantities, valid for arbitrary offspring distributions. A
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees#780907
- Sharp Order Laws and Finite-Defect Stability for Domination versus Small Laplacian Eigenvalues in Trees#779532
- A Superdiffusive Local Limit Theorem for the Elephant Random Walk and the Breakdown of Log-Concavity#1084677
- On Eternal Connected Vertex Cover#1144070
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph#818668
Record · ID 1129301
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive