Algorithms and Models for the Web-Graph: 7th International Workshop, WAW 2010, Stanford, CA, USA, December 13-14, 2010. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Models for the Web-Graph, WAW 2010, held in Stanford, CA, USA, in December 2010, which was co-located with the 6th International Workshop on Internet and Network Economics (WINE 2010).

The 13 revised full papers and the invited paper presented were carefully reviewed and selected from 19 submissions.

Author(s): Andrei Broder (auth.), Ravi Kumar, Dandapani Sivakumar (eds.)
Series: Lecture Notes in Computer Science 6516 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 163
Tags: Artificial Intelligence (incl. Robotics); Information Systems Applications (incl.Internet); Information Storage and Retrieval; Algorithm Analysis and Problem Complexity; Database Management; Data Mining and Knowledge Discovery

Front Matter....Pages -
The Anatomy of the Long Tail of Consumer Demand....Pages 1-1
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification....Pages 2-14
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning....Pages 15-24
Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types....Pages 25-35
Component Evolution in General Random Intersection Graphs....Pages 36-49
Modeling Traffic on the Web Graph....Pages 50-61
Multiplicative Attribute Graph Model of Real-World Networks....Pages 62-73
Random Walks on Digraphs, the Generalized Digraph Laplacian and the Degree of Asymmetry....Pages 74-85
Finding and Visualizing Graph Clusters Using PageRank Optimization....Pages 86-97
Improving Random Walk Estimation Accuracy with Uniform Restarts....Pages 98-109
The Geometric Protean Model for On-Line Social Networks....Pages 110-121
Constant Price of Anarchy in Network Creation Games via Public Service Advertising....Pages 122-131
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks....Pages 132-145
Game-Theoretic Models of Information Overload in Social Networks....Pages 146-161
Back Matter....Pages -