Level of nodes in increasing trees revisited
From MaRDI portal
Publication:5433258
DOI10.1002/rsa.20161zbMath1131.05029OpenAlexW4253682120MaRDI QIDQ5433258
Alois Panholzer, Prodinger, Helmut
Publication date: 8 January 2008
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20161
Related Items
On bucket increasing trees, clustered increasing trees and increasing diamonds ⋮ Limit Theorems for Subtree Size Profiles of Increasing Trees ⋮ Parking functions for mappings ⋮ On moment sequences and mixed Poisson distributions ⋮ On the degree distribution of the nodes in increasing trees ⋮ On the distribution of betweenness centrality in random trees ⋮ Labels distance in bucket recursive trees with variable capacities of buckets ⋮ Unnamed Item ⋮ Limit laws for two distance-based indices in random recursive tree models ⋮ Generalized Stirling permutations, families of increasing trees and urn models ⋮ Tree evolution processes for bucket increasing trees ⋮ Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Occupancy problems related to the generalized Stirling numbers ⋮ On the distribution of eigenvalues of increasing trees ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Depth in bucket recursive trees with variable capacities of buckets ⋮ The height of increasing trees ⋮ Deterministic Edge Weights in Increasing Tree Families ⋮ On edge-weighted recursive trees and inversions in random permutations ⋮ On the distribution of distances between specified nodes in increasing trees ⋮ Parking function varieties for combinatorial tree models ⋮ Random Recursive Trees and Preferential Attachment Trees are Random Split Trees ⋮ Combinatorial Analysis of Growth Models for Series-Parallel Networks ⋮ A central limit theorem for additive functionals of increasing trees ⋮ Analysis of Statistics for Generalized Stirling Permutations ⋮ Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees ⋮ Ancestors and descendants in evolving k‐tree models ⋮ An involution on increasing trees ⋮ Distinct fringe subtrees in random trees
Cites Work
