Distribution of nodes of a tree by degree
From MaRDI portal
Cites work
Cited in
(27)- Limit distribution for the maximum degree of a random recursive tree
- Cutting down recursive trees
- Isolating the most recent entry in a random recursive tree by random cuts
- Dynamical models for random simplicial complexes
- Correction terms for the height of weighted recursive trees
- On joint properties of vertices with a given degree or label in the random recursive tree
- An involution on increasing trees
- On leaf related statistics in recursive tree models
- Long and short paths in uniform random recursive dags
- Asymptotic joint normality of counts of uncorrelated motifs in recursive trees
- Depth properties of scaled attachment random recursive trees
- High degrees in recursive trees
- Markov branching in the vertex splitting model
- Emergent network modularity
- Limit laws for local counters in random binary search trees
- Note on the heights of random recursive trees and random m‐ary search trees
- A non-increasing tree growth process for recursive trees and applications
- Depth of vertices with high degree in random recursive trees
- Building random trees from blocks
- Profiles of random trees: correlation and width of random recursive trees and binary search trees
- Degree distributions in recursive trees with fitnesses
- The maximal degree in random recursive graphs with random weights
- Inference in balanced community modulated recursive trees
- Approximation of subgraph counts in the uniform attachment model
- Uniform attachment with freezing
- On the number of leaves in a random recursive tree
- On the complexity of algorithms on recursive trees
This page was built for publication: Distribution of nodes of a tree by degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2538631)
