ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing Letters
Volume 102, Issue 4, 16 May 2007, Pages 156-162
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (155 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ipl.2006.12.009    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Preferential deletion in dynamic models of web-like networks

Narsingh DeoCorresponding Author Contact Information, a, E-mail The Corresponding Author and Aurel Camia, E-mail The Corresponding Author

aSchool of Computer Science, University of Central Florida, Orlando, FL 32816-2632, USA

Received 29 September 2005. 
Communicated by F. Dehne. 
Available online 9 January 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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−(2p/2p−1).

Keywords: Web-like networks; Interconnection networks; Dynamic random graph modeling; Preferential node deletion; Scale-free; Power-law degree distribution


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.