• Corpus ID: 240354086

Statistical Inference in Parametric Preferential Attachment Trees

@inproceedings{Gao2021StatisticalII,
  title={Statistical Inference in Parametric Preferential Attachment Trees},
  author={Fengnan Gao and Aad van der Vaart},
  year={2021}
}
The preferential attachment (PA) model is a popular way of modelling dynamic social networks, such as collaboration networks. Assuming that the PA function takes a parametric form, we propose and study the maximum likelihood estimator of the parameter. Using a supercritical continuous-time branching process framework, we prove the almost sure consistency and asymptotic normality of this estimator. We also provide an estimator that only depends on the final snapshot of the network and prove its… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 23 REFERENCES

Asymptotic normality of degree counts in a preferential attachment model

TLDR
Asymptotic normality of degree counts is studied for a sequence of growing simple undirected preferential attachment graphs for understanding the dynamics of social networks.

Consistent Estimation in General Sublinear Preferential Attachment Trees

TLDR
Using a supercritical continuous-time branching process framework, the almost sure consistency of the proposed empirical estimator of the preferential attachment function $f$ in the setting of general preferential attachment trees is proved.

Connectivity Transitions in Networks with Super-Linear Preferential Attachment

We analyze an evolving network model of Krapivsky and Redner in which new nodes arrive sequentially, each connecting to a previously existing node b with probability proportional to the pth power of

Random Graphs and Complex Networks

  • R. Hofstad
  • Computer Science
    Cambridge Series in Statistical and Probabilistic Mathematics
  • 2016
TLDR
This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.

Emergence of scaling in random networks

TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Random trees and general branching processes

TLDR
Considering the evolution of the random tree in continuous time, the process may be viewed as a general branching process, this way classical results can be applied and the asymptotical degree distribution for a wide range of weight functions is given.