Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 24 min ago
PreprintLicence not statedHAL

Rare subtree patterns in size-conditioned Bienaymé trees: Poisson approximation and declumping

  • Igor Kortchemski
  • Leonard Vetter
Open at sourceCite

Related

  1. The Price of Feasibility: Greedy Approximation Bounds for String Supermodular Optimization over Oracle-Conditioned Greedoids
    Joan Vendrell Gallart, Russell Bent, Solmaz Kia
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  2. Two moments suffice for Bessel approximation: conditioned differences, contingency tables, and probabilistic divide-and-conquer
    Stephen DeSalvo
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  3. The skeleton-blocks decomposition of Bienaymé trees, and applications to their local convergence
    Marc Bernard, Robin Stephenson
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  4. Subtree Counts and the Maximum Mean Subtree Order
    Jungang Chen, Xian'an Jin, Zhuo Li +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Receiver-Surface Hit Patterns via Legendre Approximation for Molecular Signal Detection
    Yasin Bastug, Erencem Ozbey, H. Birkan Yilmaz
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{kortchemski2026rare,
  title = {{Rare subtree patterns in size-conditioned Bienaymé trees: Poisson approximation and declumping}},
  author = {Igor Kortchemski and Leonard Vetter},
  howpublished = {HAL},
  year = {2026},
  month = jul,
  eprint = {2607.22291},
  archivePrefix = {arXiv},
  url = {https://hal.science/hal-05759889v1},
}
RIS
TY  - UNPB
TI  - Rare subtree patterns in size-conditioned Bienaymé trees: Poisson approximation and declumping
AU  - Igor Kortchemski
AU  - Leonard Vetter
PY  - 2026
DA  - 2026/07/24
PB  - HAL
UR  - https://hal.science/hal-05759889v1
ER  -