Preferential deletion in dynamic models of web-like networks

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^).

[1]  B. Bollobás.  The evolution of random graphs , 1984 .

[2]  S. N. Dorogovtsev,et al.  Scaling Behaviour of Developing and Decaying Networks , 2000, cond-mat/0005050.

[3]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[4]  Alessandro Vespignani,et al.  Large-scale topological and dynamical properties of the Internet. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[6]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[7]  Károly Jordán.  Calculus of finite differences , 1951 .

[8]  Béla Bollobás,et al.  The degree sequence of a scale‐free random graph process , 2001, Random Struct. Algorithms.

[9]  Fan Chung Graham,et al.  Random evolution in massive graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[10]  Alan M. Frieze,et al.  Random Deletion in a Scale-Free Random Graph Process , 2004, Internet Math..

[11]  Fan Chung Graham,et al.  Coupling Online and Offline Analyses for Random Power Law Graphs , 2004, Internet Math..

[12]  Alan M. Frieze,et al.  A general model of web graphs , 2003, Random Struct. Algorithms.

[13]  Andrei Z. Broder,et al.  Sic transit gloria telae: towards an understanding of the web's decay , 2004, WWW '04.

[14]  S. Redner,et al.  Rate Equation Approach for Growing Networks , 2003 .

[15]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[16]  C. Jordan,et al.  Calculus of Finite Differences. , 1963 .