The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Code-Red: a case study on the spread and victims of an internet worm
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
How to Own the Internet in Your Spare Time
Proceedings of the 11th USENIX Security Symposium
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Recent worms: a survey and trends
Proceedings of the 2003 ACM workshop on Rapid malcode
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
The impact of the power law exponent on the behavior of a dynamic epidemic type process
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Multi-commodity allocation for dynamic demands using pagerank vectors
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Communications of the ACM
| Hi-index | 0.02 |
We give a rigorous analysis of variations of the contact process on a finite graph in which the cure rate is allowed to vary from one vertex to the next, and even to depend on the current state of the system. In particular, we study the epidemic threshold in the models where the cure rate is proportional to the degree of the node or when it is proportional to the number of its infected neighbors. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010