Fitting the linear preferential attachment model
The evolution of a network can be described by the preferential attachment mechanism in which edges and nodes are added to a network with certain probabilities. In general, the in- and out- degree distributions follow a power law. The authors discuss methods for fitting a 5-parameter linear preferential model to network data when full history of the network formation is known as well as when only a single-time snapshot of the network is available. In the former case, MLEs of the parameters are derived and shown to be strongly consistent and asymptotically normal. In the second case, an estimator based on method of moments combined with an approximation to likelihood is proposed which is also strongly consistent and behaves as well as the MLE. Both estimation procedures are illustrated by simulations. The authors give a lucid introduction and details of the mathematical results and acknowledge an efficient algorithm by Joyjit Roy ``designed to capitalize on the linear growth structure.
- Robust analysis of preferential attachment models with fitness
- Consistency of Hill estimators in a linear preferential attachment model
- A preferential attachment model with random initial degrees
- Recency-based preferential attachment models
- Diameters in preferential attachment models
- Linear de-preferential urn models
- Parameter specification for the degree distribution of simulated Barabási-Albert graphs
- A network epidemic model for online community commissioning data
- Change point detection in network models: preferential attachment and long range dependence
- Asymptotic dependence of in- and out-degrees in a preferential attachment model with reciprocity
- Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms
- Degree growth rates and index estimation in a directed preferential attachment model
- Are extreme value estimation methods useful for network data?
- Inference for the degree distributions of preferential attachment networks with zero-degree nodes
- On the asymptotic normality of estimating the affine preferential attachment network models with random initial degrees
- Consistent estimation in general sublinear preferential attachment trees
- Consistency of Hill estimators in a linear preferential attachment model
- Some Typical Properties of the Spatial Preferred Attachment Model
- Core size and densification in preferential attachment networks
- Asymptotic normality of in- and out-degree counts in a preferential attachment model
- Recency-based preferential attachment models
- Non-parametric estimation of the preferential attachment function from one network snapshot
- On a minimum distance procedure for threshold selection in tail analysis
- Measuring reciprocity in a directed preferential attachment network
- Growth of common friends in a preferential attachment model
- Asymptotic normality of degree counts in a preferential attachment model
- Random networks with heterogeneous reciprocity
- Poisson edge growth and preferential attachment networks
- A strength and sparsity preserving algorithm for generating weighted, directed networks with predetermined assortativity
- Recent advances on mechanisms of network generation: community, exchangeability, and scale-free properties
- Adaptive importance sampling for network growth models
- Preferred attachment in affiliation networks
- Generating directed networks with predetermined assortativity measures
This page was built for publication: Fitting the linear preferential attachment model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408253)
