The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Random evolution in massive graphs
Handbook of massive data sets
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Sic transit gloria telae: towards an understanding of the web's decay
Proceedings of the 13th international conference on World Wide Web
A practical simulation method for social networks
AWC '13 Proceedings of the First Australasian Web Conference - Volume 144
| Hi-index | 0.89 |
In this paper a discrete-time dynamic random graph process is studied that interleaves the birth of nodes and edges with the death of nodes. In this model, at each time step either a new node is added or an existing node is deleted. A node is added with probability p together with an edge incident on it. The node at the other end of this new edge is chosen based on a linear preferential attachment rule. A node (and all the edges incident on it) is deleted with probability q=1-p. The node to be deleted is chosen based on a probability distribution that favors small-degree nodes, in view of recent empirical findings. We analyze the degree distribution of this model and find that the expected fraction of nodes with degree k in the graph generated by this process decreases asymptotically as k^-^1^-^(^2^p^/^2^p^-^1^).