A scaling limit for the degree distribution in sublinear preferential attachment schemes
From MaRDI portal
(Redirected from Publication:5740272)
Abstract: We consider a general class of preferential attachment schemes evolving by a reinforcement rule with respect to certain sublinear weights. In these schemes, which grow a random network, the sequence of degree distributions is an object of interest which sheds light on the evolving structures. In this article, we use a fluid limit approach to prove a functional law of large numbers for the degree structure in this class, starting from a variety of initial conditions. The method appears robust and applies in particular to `non-tree' evolutions where cycles may develop in the network. A main part of the argument is to analyze an infinite system of coupled ODEs, corresponding to a rate formulation of the law of large numbers limit, in terms of -semigroup/dynamical systems methods. These results also resolve a question in Chung, Handjani and Jungreis (2003).
Recommendations
- Large deviations for the degree structure in preferential attachment schemes
- Random networks with sublinear preferential attachment: degree evolutions
- On the growth of a superlinear preferential attachment scheme
- Joint degree distributions of preferential attachment random graphs
- Scale-free property for degrees and weights in a preferential attachment random graph model
Cites work
- A Brief History of Generative Models for Power Law and Lognormal Distributions
- A survey of random processes with reinforcement
- AN OVERVIEW OF SOME STOCHASTIC STABILITY METHODS(<Special Issue>Network Design, Control and Optimization)
- Asymptotic behavior of a metapopulation model
- Complex networks. Structure, robustness and function.
- Connectivity Transitions in Networks with Super-Linear Preferential Attachment
- Degree asymptotics with rates for preferential attachment random graphs
- Differential equation approximations for Markov chains
- Differential equations for random processes and random graphs
- Erdős-Renyi random graphs \(+\) forest fires \(=\) self-organized criticality
- Growth of preferential attachment random graphs via continuous-time branching processes
- scientific article; zbMATH DE number 3885703 (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 2119677 (Why is no real title available?)
- Kolmogorov's differential equations and positive semigroups on first moment sequence spaces
- Large deviations for the degree structure in preferential attachment schemes
- Networks. An introduction.
- ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
- On a preferential attachment and generalized Pólya's urn model
- Power laws in preferential attachment graphs and Stein's method for the negative binomial distribution
- Preferential Attachment Random Graphs with General Weight Function
- Random networks with sublinear preferential attachment: degree evolutions
- Random trees and general branching processes
- Scale-Free Networks
- Scale-free networks: a decade and beyond
- Statistical mechanics of complex networks
- The degree sequence of a scale-free random graph process
- The Structure and Function of Complex Networks
Cited in
(6)- Random networks with sublinear preferential attachment: degree evolutions
- Large deviations for the degree structure in preferential attachment schemes
- Sublinear preferential attachment combined with a growing number of choices
- On the growth of a superlinear preferential attachment scheme
- Sublinear but never superlinear preferential attachment by local network growth
- Network evolution with mesoscopic delays
This page was built for publication: A scaling limit for the degree distribution in sublinear preferential attachment schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740272)
