Level of nodes in increasing trees revisited
From MaRDI portal
(Redirected from Publication:5433258)
Recommendations
- On the degree distribution of the nodes in increasing trees
- Levels of a scale-free tree
- On the distribution of depths in increasing trees
- scientific article; zbMATH DE number 2114471
- Level number sequences for trees
- Level generating trees and proper Riordan arrays
- The Variance of Level Numbers in Certain Families of Trees
- scientific article; zbMATH DE number 1222137
Cites work
- Cutting down very simple trees
- scientific article; zbMATH DE number 17686 (Why is no real title available?)
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1142298 (Why is no real title available?)
- On the Altitude of Nodes in Random Trees
Cited in
(37)- On the distribution of betweenness centrality in random trees
- Parking function varieties for combinatorial tree models
- Distinct fringe subtrees in random trees
- An involution on increasing trees
- Depth in bucket recursive trees with variable capacities of buckets
- On edge-weighted recursive trees and inversions in random permutations
- Labels distance in bucket recursive trees with variable capacities of buckets
- Limit laws for two distance-based indices in random recursive tree models
- Parking functions for mappings
- Limit theorems for subtree size profiles of increasing trees
- Analysis of statistics for generalized Stirling permutations
- Limit theorems for depths and distances in weighted random b-ary recursive trees
- On moment sequences and mixed Poisson distributions
- Levels of a scale-free tree
- Deterministic edge weights in increasing tree families
- scientific article; zbMATH DE number 2159651 (Why is no real title available?)
- The moments of the Sackin index of random d-ary increasing trees
- 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
- Some results for monotonically labelled simply generated trees
- Ancestors and descendants in evolving k‐tree models
- On bucket increasing trees, clustered increasing trees and increasing diamonds
- The height of increasing trees
- Tree evolution processes for bucket increasing trees
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments
- On the distribution of depths in increasing trees
- Occupancy problems related to the generalized Stirling numbers
- Generalized Stirling permutations, families of increasing trees and urn models
- On the distribution of eigenvalues of increasing trees
- The combinatorics of a tree-like functional equation for connected chord diagrams
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
- Dickman approximation of weighted sums of independent random variables in the Kolmogorov distance
- Statistical aspects of weighted balls in boxes problems with an emphasis on population models
- Descendants in increasing trees
- On the degree distribution of the nodes in increasing trees
- On the distribution of distances between specified nodes in increasing trees
This page was built for publication: Level of nodes in increasing trees revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5433258)
