Papers › 0-1 laws for pattern occurrences in phylogenetic trees and networks

0-1 laws for pattern occurrences in phylogenetic trees and networks

7 Feb 2024arXiv:2402.04499archive 2025-07-28

François Bienvenu, Mike Steel

In a recent paper, the question of determining the fraction of binary trees that contain a fixed pattern known as the snowflake was posed. We show that this fraction goes to 1, providing two very different proofs: a purely combinatorial one that is quantitative and specific to this problem; and a proof using branching process techniques that is less explicit, but also much more general, as it applies to any fixed patterns and can be extended to other trees and networks. In particular, it follows immediately from our second proof that the fraction of d-ary trees (resp. level-k networks) that contain a fixed d-ary tree (resp. level-k network) tends to 1 as the number of leaves grows.

Paper PDF

Code

No code repository is listed for this paper in the archive or in Syntology's graph.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

10-shot image generation 3D Anomaly Detection and Segmentation 3D Face Reconstruction Articles Automated Theorem Proving DeepFake Detection Face Swapping Informativeness Object Detection Object Tracking Shadow Removal Style Transfer Text-to-Image Generation Unconditional Video Generation Unsupervised Domain Adaptation Video Object Detection Weakly-Supervised Semantic Segmentation Zero-shot 3D Point Cloud Classification

Datasets

Introduced by this paper, per the archive.

SQuAD

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections