Counting paths in perfect trees

11/23/2017
by   Peter J. Humphries, et al.
0

We present some exact expressions for the number of paths of a given length in a perfect m-ary tree. We first count the paths in perfect rooted m-ary trees and then use the results to determine the number of paths in perfect unrooted m-ary trees, extending a known result for binary trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2022

Growth and irreducibility in path-incompressible trees

We study effective randomness-preserving transformations of path-incompr...
research
08/22/2019

Exact inference under the perfect phylogeny model

Motivation: Many inference tools use the Perfect Phylogeny Model (PPM) t...
research
11/03/2018

Efficient Projection onto the Perfect Phylogeny Model

Several algorithms build on the perfect phylogeny model to infer evoluti...
research
07/12/2020

Perfect Sampling of Multivariate Hawkes Process

As an extension of self-exciting Hawkes process, the multivariate Hawkes...
research
01/23/2022

On the Homomorphism Order of Oriented Paths and Trees

A partial order is universal if it contains every countable partial orde...
research
04/19/2018

A third strike against perfect phylogeny

Perfect phylogenies are fundamental in the study of evolutionary trees b...
research
02/20/2023

Comparison of orchard networks using their extended μ-representation

Phylogenetic networks generalize phylogenetic trees in order to model re...

Please sign up or login with your details

Forgot password? Click here to reset