Simulating the webgraph: A comparative analysis of models

Computing in Science and Engineering

Volumn 6, Issue 6, 2004, Pages 84-89

  Donato, Debora ^a   Laura, Luigi ^a   Leonardi, Stefano ^a   Millozzi, Stefano ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; HYPERLINKS; TUPLES; WEBGRAPH;

ALGORITHMS; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA STRUCTURES; GRAPHIC METHODS; HTML; INTERFACES (COMPUTER); MATHEMATICAL MODELS; PROBLEM SOLVING; RANDOM PROCESSES; RESEARCH AND DEVELOPMENT MANAGEMENT; STRATEGIC PLANNING;

WEBSITES;

EID: 8644222137     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCSE.2004.73     Document Type: Review

References (22)

1. J. Kleinberg et al., "The Web as a Graph: Measurements, Models and Methods," Proc. Int'l Conf. Combinatorics and Computing, vol. 1627, Springer-Verlag, 1999, pp. 1-18.
2. R. Albert, H. Jeong, and A.L. Barabasi, "Diameter of the World Wide Web," Nature, vol. 401, 9 Sept. 1999, pp. 130-131.
3. A.L. Barabasi and E. Bonabeau, "Scale-Free Networks," Scientific Am., vol. 288, no. 5, 2003, pp. 60-69.
4. A. Broder et al., "Graph Structure in the Web," Computer Networks, vol. 33, June 2000, pp. 309-320.
5. S. Milgram, "The Small World Problem," Psychology Today, vol. 61, May 1967, pp. 60-67.
6. D. Watts and S. Strogatz, "Collective Dynamics of Small-World Networks," Nature, vol. 393, 4 May 1998, pp. 440-443.
7. J. Kleinberg, "The Small World Phenomenon: An Algorithmic Perspective," Proc. 32nd ACM Symp. Theory of Computing, ACM Press, 2000, pp. 163-170.
8. S. Brin and L. Page, "The Anatomy of a Large-Scale Hypertextual Web Search Engine," Computer Networks and ISDN Systems, vol. 30, nos. 1-7, 1998, pp. 107-117.
9. G. Pandurangan, P. Raghavan, and E. Upfal, "Using PageRank to Characterize Web Structure," Proc. 8th Ann. Int'l Conf. Combinatorics and Computing, vol. 2387, Springer-Verlag, 2002, pp. 330-339.
10. D. Donato et al., "Large Scale Properties of the Webgraph," European J. Physics B, vol. 38, no. 2, 2004, pp. 239-243.
11. R. Kumar et al., "Trawling the Web for Emerging Cyber Communities," Proc. 8th WWW Conf., Elsevier, 1999, pp. 1481-1493.
12. S. Dill et al., "Self-Similarity in the Web," Proc. 27th VLDB Conf., Univ. of Trier, 2001, pp. 69-78; http://dblp.uni-trier.de.
13. D.M. Pennock et al., "Winners Don't Take All: Characterizing the Competition for Links on the Web," Proc. Nat'l Academy of Sciences, vol. 99, no. 8, 2002, pp. 5207-5211.
14. P. Erdös and R. Renyi, "On the Evolution of Random Graphs," Publication Mathematical. Inst. Hungarian Academy of Science, vol. 5, 1960, pp. 17-61.
15. R. Albert and A.L. Barabasi, "Statistical Mechanics of Complex Networks," Rev. Modern Physics, vol. 74, no. 1, 2002, pp. 47-97.
16. R. Kumar et al., "Random Graph Models for the Web Graph," Proc. 41st Foundations of Computer Science, IEEE CS Press, 2000, pp. 57-65.
17. L. Laura et al., "A Multi-Layer Model for the Webgraph," Online Proc. 2nd Int'l Workshop on Web Dynamics, 2002, www.dcs.bbk.ac. uk/webDyn2/onlineProceedings.html.
18. A.J. Walker, "An Efficient Method for Generating Discrete Random Variables with General Distributions," ACM Trans. Mathematical Software, vol. 3, no. 3, 1977, pp. 253-256.
19. D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, Addison-Wesley, 1997.
20. C. Cormode and S. Muthukrishnan, "What's Hot and What's Not: Tracking Most Frequent Items Dynamically," Proc. 22nd ACM Symp. Principles of Database Systems, ACM Press, 2003, pp. 296-306.
21. B. Bollobas and O. Riordan, "Robustness and Vulnerability of Scale-Free Random Graphs," Internet Mathematics, vol. 1, no. 1, 2003, pp. 1-35.
22. R. Kraft, E. Hastor, and R. Stata, "Timelinks: Exploring the Link Structure of the Evolving Web," Proc. 2nd Workshop on Algorithms and Models for the Web-Graph (WAW2003), 2003, www.soe.ucsc.edu/-rekraft/papers.htm.