On the continuous-time limit of the Barabási-Albert random graph

DOI10.1016/J.AMC.2020.125177zbMATH Open1465.05163arXiv1607.04183OpenAlexW3014361950MaRDI QIDQ2177889FDOQ2177889

Authors: Angelica Pachón, Federico Polito, Laura Sacerdote 

Publication date: 7 May 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Abstract: We prove that the Barab'asi-Albert model converges weakly to a set of generalized Yule models via an appropriate scaling. To pursue this aim we superimpose to its graph structure a suitable set of processes that we call the planted model and we introduce an ad-hoc sampling procedure. The use of the obtained limit process represents an alternative and advantageous way of looking at some of the asymptotic properties of the Barab'asi-Albert random graph.

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

Recommendations

• Random graphs associated to some discrete and continuous time preferential attachment models
• A new class of scale free random graphs
• Asymptotic behavior and distributional limits of preferential attachment graphs
• On random trees
• scientific article; zbMATH DE number 5763194

zbMATH Keywords

Yule modeldiscrete- and continuous-time modelsplanted modelpreferential attachment random graphsBarabási-Albert model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Stochastic network models in operations research (90B15)

Cites Work

• Power-law distributions in empirical data
• Title not available (Why is that?)
• Random graphs and complex networks. Volume 1
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Title not available (Why is that?)
• Stochastic inequalities on partially ordered spaces
• The degree sequence of a scale-free random graph process
• A general model of web graphs
• A preferential attachment model with random initial degrees
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• Random graphs associated to some discrete and continuous time preferential attachment models
• The role of detachment of in-links in scale-free networks
• Finiteness and fluctuations in growing networks
• Title not available (Why is that?)
• Random trees and general branching processes
• Generalized nonlinear Yule models
• Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
• The dynamics of power laws: fitness and aging in preferential attachment trees
• Preferential attachment random graphs with general weight function

Cited In (4)

• Random graphs associated to some discrete and continuous time preferential attachment models
• Barabási-Albert random graph with multiple type edges and perturbation
• A generalization of the Barabási-Albert random tree
• Studies on generalized Yule models

Uses Software

• plfit

This page was built for publication: On the continuous-time limit of the Barabási-Albert random graph

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