Leaves of preferential attachment trees

DOI10.1088/1751-8121/AE5BD7MaRDI QIDQ7253904zbMATH OpenFDO

Authors Harrison Hartle, P. L. Krapivsky

Publication date 28 May 2026

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1751-8121/AE5BD7

zbMATH Keywords

random graphspreferential attachmentstatistical physics

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Taxonomy, cladistics, statistics in mathematical biology (92B10)

Cites work

• scientific article; zbMATH DE number 3162185 (Why is no real title available?)
• scientific article; zbMATH DE number 5763194 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 2050468 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• scientific article; zbMATH DE number 1409619 (Why is no real title available?)
• scientific article; zbMATH DE number 6737879 (Why is no real title available?)
• A critical point for random graphs with a given degree sequence
• A kinetic view of statistical physics
• Algorithms and Computation
• An asymptotic evaluation of the cycle index of a symmetric group
• An invitation to analytic combinatorics. From one to several variables
• Analytic combinatorics
• Asymptotic degree distribution in random recursive trees
• Asymptotic normality in random graphs with given vertex degrees
• Asymptotic properties of protected nodes in random recursive trees
• Barabasi-Albert trees are hypoenergetic
• Emergence of Scaling in Random Networks
• Emergent network modularity
• Finiteness and fluctuations in growing networks
• Higher-order networks. An introduction to simplicial complexes
• How to deal with unlabeled random graphs
• Introduction to Random Graphs
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Mean field solution of the Ising model on a Barabási-Albert network
• Networks. An introduction.
• Notes on protected nodes in digital search trees
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• On a random search tree: asymptotic enumeration of vertices by distance from leaves
• Power-law distributions in empirical data
• Protected nodes and fringe subtrees in some random trees
• Random Trees
• Random recursive hypergraphs
• Sparse graphs: metrics and random models
• Stratification in the preferential attachment network
• The Nature of Complex Networks
• The degree sequence of a scale-free random graph process
• The diameter of a scale-free random graph
• Tight conditions for spanning trees with leaf degree at most k in graphs
• Twenty Combinatorial Examples of Asymptotics Derived from Multivariate Generating Functions
• Width of a scale-free tree
• k-protected vertices in binary search trees

This page was built for publication: Leaves of preferential attachment trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253904)