Preferential deletion in dynamic models of web-like networks
type: Item
instance of: scholarly article
title: Preferential deletion in dynamic models of web-like networks
zbMATH Open document ID: 1184.68025
author: Narsingh Deo
author: Aurel Cami
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 5664798
zbMATH Keywords: web-like networks
zbMATH Keywords: interconnection networks
zbMATH Keywords: dynamic random graph modeling
zbMATH Keywords: preferential node deletion
zbMATH Keywords: scale-free
zbMATH Keywords: power-law degree distribution
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.12.009
OpenAlex ID: W2086797625
cites work: Q4552043
cites work: Robustness and Vulnerability of Scale-Free Random Graphs
cites work: The degree sequence of a scale-free random graph process
cites work: Coupling Online and Offline Analyses for Random Power Law Graphs
cites work: A general model of web graphs
cites work: Random Deletion in a Scale-Free Random Graph Process
cites work: Q3286850
cites work: Q5535148
cites work: Q5395260
cites work: The Structure and Function of Complex Networks
DOI: 10.1016/J.IPL.2006.12.009
Recommended article: An edge deletion model for complex networks
Recommended article: Random Deletion in a Scale-Free Random Graph Process
Recommended article: A local-world node deleting evolving network model
Recommended article: Modeling interacting dynamic networks: I. Preferred degree networks and their characteristics
Recommended article: Degree correlations in growing networks with deletion of nodes
Recommended article: Deleting edges to restrict the size of an epidemic in temporal networks
Recommended article: Q5092419
Recommended article: Adversarial Deletion in a Scale-Free Random Graph Process
Recommended article: Adversarial deletion in a scale free random graph process
description: scientific article; zbMATH DE number 5664798