On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees

DOI10.1080/10586458.2015.1065525zbMath1386.60031OpenAlexW2293161775MaRDI QIDQ2815493

Mohan Gopaladesikan, Mark Daniel Ward, Stephan G. Wagner

Publication date: 29 June 2016

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10586458.2015.1065525

zbMATH Keywords

generating functionsasymptotic analysisanalytic combinatoricsforbidden patternsrecursiv trees

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05)

Related Items (2)

Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ On the variety of shapes in digital trees

Cites Work

• Profiles of random trees: Limit theorems for random recursive trees and binary search trees
• Consecutive patterns in permutations
• Computing the zeros of analytic functions
• Asymptotic joint normality of counts of uncorrelated motifs in recursive trees

This page was built for publication: On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees