Preferential deletion in dynamic models of web-like networks

DOI10.1016/j.ipl.2006.12.009zbMath1184.68025OpenAlexW2086797625MaRDI QIDQ845994

Narsingh Deo, Aurel Cami

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.009

zbMATH Keywords

interconnection networksscale-freepower-law degree distributiondynamic random graph modelingpreferential node deletionweb-like networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

A class of random recursive tree algorithms with deletion ⋮ Dynamic random networks in dynamic populations ⋮ Random Networks with Preferential Growth and Vertex Death

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The degree sequence of a scale-free random graph process
• The Structure and Function of Complex Networks
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Random Deletion in a Scale-Free Random Graph Process
• Robustness and Vulnerability of Scale-Free Random Graphs
• A general model of web graphs

This page was built for publication: Preferential deletion in dynamic models of web-like networks