Preferential deletion in dynamic models of web-like networks

DOI10.1016/J.IPL.2006.12.009MaRDI QIDQ845994zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An edge deletion model for complex networks
• Random Deletion in a Scale-Free Random Graph Process
• A local-world node deleting evolving network model
• Modeling interacting dynamic networks. I: Preferred degree networks and their characteristics
• Degree correlations in growing networks with deletion of nodes
• Deleting edges to restrict the size of an epidemic in temporal networks
• Deleting edges to restrict the size of an epidemic in temporal networks
• Adversarial Deletion in a Scale-Free Random Graph Process
• Adversarial deletion in a scale free random graph process

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1792101 (Why is no real title available?)
• scientific article; zbMATH DE number 3248272 (Why is no real title available?)
• A general model of web graphs
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Random Deletion in a Scale-Free Random Graph Process
• Rate equation appraoch for growing networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• The Structure and Function of Complex Networks
• The degree sequence of a scale-free random graph process

Cited in

(12)

• Adversarial Deletion in a Scale-Free Random Graph Process
• Degree evolution in a general growing network
• Addition–deletion networks
• Degree correlations in growing networks with deletion of nodes
• Modeling interacting dynamic networks. I: Preferred degree networks and their characteristics
• Dynamic random networks in dynamic populations
• On the degree evolution of a fixed vertex in some growing networks
• Adversarial deletion in a scale free random graph process
• Random networks with preferential growth and vertex death
• A class of random recursive tree algorithms with deletion
• An edge deletion model for complex networks
• Robustness of Preferential Attachment Under Deletion of Edges

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845994)