Classifying special interest groups in web graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2483, Issue , 2002, Pages 263-275

  Cooper, Colin ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

SPECIAL INTEREST GROUPS; UPPER BOUND; WEB GRAPHS;

RANDOM PROCESSES;

EID: 84959039533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_21     Document Type: Conference Paper

References (16)

1. D. Achlioptas, A. Fiat, A.R. Karlin and F. McSherry, Web search via hub synthesis, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (2001) 500-509.
2. M. Adler and M. Mitzenmacher, Toward Compressing Web Graphs, To appear in the 2001 Data Compression Conference.
3. W. Aiello, F. Chung and L. Lu, Random evolution in massive graphs, Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (2001) 510-519.
4. R. Albert, A. Barabasi and H. Jeong. Diameter of the world wide web. Nature 401: 103-131 (1999) see also http://xxx.lanl.gov/abs/cond-mat/9907038
5. B. Bollobás, O. Riordan and J. Spencer, The degree sequence of a scale free random graph process, to appear.
6. B. Bollobás and O. Riordan, The diameter of a scale free random graph, to appear.
7. A. Broder, R. Kumar, F.Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins and J. Wiener. Graph structure in the web. http://gatekeeper.dec.com/pub/DEC/SRC/publications/stata/www9.htm
8. A. Broder, R. Krauthgamer and M. Mitzenmacher. Improved classification via connectivity information.
9. S. Chakrabarti, B. Dom and P. Indyk. Enhanced hypertext categorization using hyperlinks. Proceedings of ACM SIGMOD Conference on management of Data (1998) p 307-318.
10. C. Cooper and A.M. Frieze, A general model of web graphs, Proceedings of ESA 2001, 500-511.
11. E. Drinea, M. Enachescu and M. Mitzenmacher, Variations on random graph models for the web.
12. M.R. Henzinger, A. Heydon, M. Mitzenmacher and M. Najork, Measuring Index Quality Using Random Walks on the Web, WWW8 / Computer Networks 31 (1999) 1291-1303.
13. W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13-30.
14. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. The web as a graph. www.almaden.ibm.com
15. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins and E. Upfal. Stochastic models for the web graph. www.almaden.ibm.com
16. F. McSherry. Spectral partitioning of random graphs FOCS 2001