On several properties of a class of hybrid recursive trees
From MaRDI portal
Publication:6164843
DOI10.1007/s11009-023-09988-zzbMath1514.05035OpenAlexW4319460131MaRDI QIDQ6164843
Publication date: 4 July 2023
Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11009-023-09988-z
degree distributionpreferential attachmentZagreb indexscale-freeuniform attachmenthybrid recursive trees
Cites Work
- An explicit formula for the coefficients in Laplace's method
- The power of choice combined with preferential attachement
- The degree profile in some classes of random graphs that generalize recursive trees
- Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees
- Twitter event networks and the superstar model
- Distances in random plane-oriented recursive trees
- Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
- Several topological indices of random caterpillars
- Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
- The degree sequence of a scale-free random graph process
- Emergence of Scaling in Random Networks
- On the Zagreb Index of Random Recursive Trees
- Profiles of random trees: Plane-oriented recursive trees
- On the number of terminal vertices in certain random trees with an application to stemma construction in philology
- A Probability Model of a Pyramid Scheme
- Random recursive forests
- On random trees
- Probability
- Note on forgotten topological index of chemical structure in drugs
- Asymptotic degree distribution in random recursive trees
- The Maximum Degree of the Barabási–Albert Random Tree
- On the structure of random plane‐oriented recursive trees and their branches
- A general model of web graphs
- ON SEVERAL PROPERTIES OF A CLASS OF PREFERENTIAL ATTACHMENT TREES—PLANE-ORIENTED RECURSIVE TREES
- THE DEGREE PROFILE AND GINI INDEX OF RANDOM CATERPILLAR TREES
- On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment Circuits
- Random Recursive Trees and Preferential Attachment Trees are Random Split Trees
- Random trees and general branching processes
- Preferential Attachment Random Graphs with General Weight Function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On several properties of a class of hybrid recursive trees