Preferential deletion in dynamic models of web-like networks
From MaRDI portal
Publication:845994
DOI10.1016/J.IPL.2006.12.009zbMATH Open1184.68025OpenAlexW2086797625MaRDI QIDQ845994FDOQ845994
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
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
interconnection networksscale-freepower-law degree distributiondynamic random graph modelingpreferential node deletionweb-like networks
Cites Work
- The Structure and Function of Complex Networks
- Title not available (Why is that?)
- The degree sequence of a scale-free random graph process
- A general model of web graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Rate equation appraoch for growing networks
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)
