Adversarial deletion in a scale free random graph process

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 287-292

  Flaxman, Abraham D ^a   Frieze, Alan M ^a   Vera, Juan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE-SCALE NETWORKS; RANDOM GRAPHS; SAMPLE GRAPHS; SCALE FREE GRAPHS;

APPROXIMATION THEORY; COMPUTER NETWORKS; CONSTRAINT THEORY; INTERNET; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING; WORLD WIDE WEB;

GRAPH THEORY;

EID: 20744453218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. R. Albert and A. Barabási and H. Jeong, Diameter of the world wide web, Nature 401 (1999) 103-131
2. W. Aiello and F. R. K. Chung and L. Lu, A random graph model for massive graphs, Proc. of the 32nd Annual ACM Symposium on the Theory of Computing, (2000) 171-180.
3. W. Aiello and F. R. K. Chung and L. Lu, Random Evolution in Massive Graphs, Proc. of IEEE Symposium on Foundations of Computer Science (2001) 510-519.
4. A. Barabasi and R. Albert, Emergence of scaling in random networks, Science 286 (1999) 509-512.
5. N. Berger and B. Bollobas and C. Borgs and J. Chayes and O. Riordan, Degree distribution of the FKP network model, Proc. of the 30th International Colloquium of Automata, Languages and Programming, (2003,) 725-738.
6. N. Berger and C. Borgs and J. Chayes and R. D'Souza and R. D. Kleinberg, Competition-induced preferential attachment.
7. B. Bollobás and O. Riordan, Mathematical Results on Scale-free Random Graphs, in Handbook of Graphs and Networks, Wiley-VCH, Berlin, 2002.
8. B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica 24 (2004) 5-34.
9. B. Bollobás and O. Riordan, Robustness and vulnerability of scale-free random graphs, Internet Mathematics 1 (2003) 1-35.
10. B. Bollobás and O. Riordan, Coupling scale free and classical random graphs.
11. B. Bollobás and O. Riordan and J. Spencer and G. Tusanády, The degree sequence of a scale-free random graph process, Random Structures and Algorithms 18 (2001) 279-290.
12. A. Broder, R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins and J. Wiener, Graph structure in the web, Proc. of the 9th Intl. World Wide Web Conference (2002) 309-320.
13. F.R.K. Chung and L. Lu, Coupling on-line and off-line analyses for random power law graphs.
14. F.R.K. Chung and L. Lu and V. Vu, Eigenvalues of random power law graphs, Annals of Combinatorics 7 (2003) 21-33.
15. F.R.K. Chung and L. Lu and V. Vu, The spectra of random graphs with expected degrees, Proc. of National Academy of Sciences 100 (2003) 6313-6318.
16. C. Cooper and A. M. Frieze, A General Model of Undirected Web Graphs, Random Structures and Algorithms 22 (2003) 311-335.
17. C. Cooper, A. Frieze and J. Vera, Random Deletion in a Scale Free Random Graph Process, Internet Mathematics, to appear.
18. P. Erdös and A. Rényi, On random graphs I, Publicationes Mathematicae Debrecen 6 (1959) 290-297.
19. M. Faloutsos and P. Faloutsos and C. Faloutsos, On Power-law Relationships of the Internet Topology, SIG-COMM (1999) 251-262.
20. Alex Fabrikant and Elias Koutsoupias and Christos H. Papadimitriou, Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet, Proc. of 29th International Colloquium of Automata, Languages and Programming (2002).
21. B. Hayes, Graph theory in practice: Part II, American Scientist 88 (2000) 104-109.
22. J. M. Kleinberg and R. Kumar and P. Raghavan and S. Rajagopalan and A. S. Tomkins, The Web as a Graph: Measurements, Models and Methods, Lecture Notes in Computer Science (1999).
23. R. Kumar and P. Raghavan and S. Rajagopalan and D. Sivakumar and A. Tomkins and E. Upfal, Stochastic Models for the Web Graph, Proc. IEEE Symposium on Foundations of Computer Science (2000).
24. C. J. H. McDiarmid, Concentration, in Probabilistic methods in algorithmic discrete mathematics, (1998) 195-248.
25. M. Mitzenmacher, A brief history of generative models for power law and lognormal distributions.
26. M. Mihail and C. H. Papadimitriou, On the Eigenvalue Power Law, Proc. of 6th International Workshop on Randomization and Approximation Techniques (2002) 254-262.
27. M. Mihail, C. H. Papadimitriou and A. Saberi, On Certain Connectivity Properties of the Internet Topology, Proc. IEEE Symposium on Foundations of Computer Science (2003).
28. M. D. Penrose, Random Geometric Graphs, Oxford University Press, 2003.
29. H. A. Simon, On a class of skew distribution functions, Biometrika 42 (1955) 425-440.
30. D. J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness, Princeton: Princeton University Press, 1999.
31. G. Yule, A mathematical theory of evolution based on the conclusions of Dr. J.C. Willis, Philosophical Transactions of the Royal Society of London (Series B) 213 (1925) 21-87.