{"paper":{"title":"Pruning of CRT-sub-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Hui He, Jean-Fran\\c{c}ois Delmas (CERMICS), Romain Abraham (MAPMO)","submitted_at":"2012-12-12T10:46:59Z","abstract_excerpt":"We study the pruning process developed by Abraham and Delmas (2012) on the discrete Galton-Watson sub-trees of the L\\'{e}vy tree which are obtained by considering the minimal sub-tree connecting the root and leaves chosen uniformly at rate $\\lambda$, see Duquesne and Le Gall (2002). The tree-valued process, as $\\lambda$ increases, has been studied by Duquesne and Winkel (2007). Notice that we have a tree-valued process indexed by two parameters the pruning parameter $\\theta$ and the intensity $\\lambda$. Our main results are: construction and marginals of the pruning process, representation of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2765","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}