On the continuous-time limit of the Barabási-Albert random graph
From MaRDI portal
(Redirected from Publication:2177889)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 5485446 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A general model of web graphs
- A preferential attachment model with random initial degrees
- Emergence of Scaling in Random Networks
- Finiteness and fluctuations in growing networks
- Generalized nonlinear Yule models
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- Power-law distributions in empirical data
- Preferential attachment random graphs with general weight function
- Random graphs and complex networks. Volume 1
- Random graphs associated to some discrete and continuous time preferential attachment models
- Random trees and general branching processes
- Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
- Stochastic inequalities on partially ordered spaces
- The Structure and Function of Complex Networks
- The degree sequence of a scale-free random graph process
- The dynamics of power laws: fitness and aging in preferential attachment trees
- The role of detachment of in-links in scale-free networks
Cited in
(4)
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)