On the dense preferential attachment graph models and their graphon induced counterpart

DOI10.1017/jpr.2019.34zbMath1416.05255arXiv1701.06760OpenAlexW2966333519MaRDI QIDQ5226260

Dávid Kunszenti-Kovács, Agnes Backhausz

Publication date: 31 July 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06760

zbMATH Keywords

dense graph limitcut normPólya urn processjumble norm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multigraph limit of the dense configuration model and the preferential attachment graph
• Limits of randomly grown graph sequences
• A survey of random processes with reinforcement
• Generalized Dirichlet distribution in Bayesian analysis
• Ferguson distributions via Polya urn schemes
• Multigraph limits, unbounded kernels, and Banach space decorated graphs
• Asymptotic behavior and distributional limits of preferential attachment graphs
• Introduction to Random Graphs
• Emergence of Scaling in Random Networks
• Identifiability for Graphexes and the Weak Kernel Metric
• On the Rate of Convergence of Moments in the Central Limit Theorem for Lattice Distributions
• A preferential attachment process approaching the Rado graph
• Preferential attachment processes approaching the Rado multigraph
• On the Convergence of Moments in the Central Limit Theorem

This page was built for publication: On the dense preferential attachment graph models and their graphon induced counterpart