Approximation of subgraph counts in the uniform attachment model

DOI10.1017/S0963548324000294MaRDI QIDQ6880012zbMATH OpenFDO

Authors Johan Björklund, Cecilia Holmgren, Svante Janson, Tiffany Y. Y. Lo

Publication date 29 December 2025

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.1017/S0963548324000294

zbMATH Keywords

distributional approximationStein's methodsubgraph countsuniform attachment model

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Central limit and other weak theorems (60F05)

Cites work

• A limit law for outputs in random recursive circuits
• Distribution of nodes of a tree by degree
• Fundamentals of Stein's method
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• Limit laws for functions of fringe trees for binary search trees and random recursive trees
• Long and short paths in uniform random recursive dags
• Longest path distance in random circuits
• Multivariate normal approximations by Stein's method and size bias couplings
• Normal Approximation by Stein’s Method
• On the depth of randomly generated circuits
• On the Expected Depth of Random Circuits
• On the variety of shapes on the fringe of a random recursive tree
• Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees
• Random Trees
• Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
• The number of descendants in a random directed acyclic graph
• The strong convergence of maximal degrees in uniform random recursive trees and dags

Cited in

(1)

• Limit laws for the generalized Zagreb indices of random graphs

This page was built for publication: Approximation of subgraph counts in the uniform attachment model

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