Lecture Notes in Computer Science 7323

Transcription

1 Lecture Notes in Computer Science 7323 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

2 Anthony Bonato Jeannette Janssen (Eds.) Algorithms and Models for the Web Graph 9th International Workshop, WAW 2012 Halifax, NS, Canada, June 22-23, 2012 Proceedings 13

3 Volume Editors Anthony Bonato Ryerson University Department of Mathematics Toronto, ON, M5B 2K3, Canada Jeannette Janssen Dalhousie University Department of Mathematics and Statistics Halifax, NS, B3H 3J5, Canada ISSN e-issn ISBN e-isbn DOI / Springer Heidelberg Dordrecht London New York Library of Congress Control Number: CR Subject Classification (1998): F.2, G.2, H.4, C.2, H.3, H.2.8, E.1 LNCS Sublibrary: SL 1 Theoretical Computer Science and General Issues Springer-Verlag Berlin Heidelberg 2012 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper Springer is part of Springer Science+Business Media (

4 Preface This volume includes a selection of papers that were accepted to the 9th Workshop on Algorithms and Models for the Web Graph, WAW 2012, held at Dalhousie University in June The 13 accepted papers address a number of topics related to complex networks such as hypergraph coloring games and voter models, algorithms for detecting nodes with large degrees, random Appolonian networks, and a sublinear algorithm for Pagerank computations. The last decade has seen intense growth in research on complex networks, ranging from the Web graph, to on-line social networks, to protein protein interaction networks. Such research has been of great practical importance, and has also pushed the frontiers in pure mathematics and graph theory. One of the goals of the 2012 workshop was to present current research on the theory and applications of complex networks. The papers presented in this volume should stimulate new and exciting directions in research on complex networks. We would like to thank the authors and reviewers for making the volume a reality. June 2012 Anthony Bonato Jeannette Janssen

5 Table of Contents Hypergraph Coloring Games and Voter Models... 1 Fan Chung and Alexander Tsiatas On a DAG Partitioning Problem Soroush Alamdari and Abbas Mehrabian Some Typical Properties of the Spatial Preferred Attachment Model Colin Cooper, Alan Frieze, and Pawe l Pra lat A Sublinear Time Algorithm for PageRank Computations Christian Borgs, Michael Brautbar, Jennifer Chayes, and Shang-Hua Teng Quick Detection of Nodes with Large Degrees Konstantin Avrachenkov, Nelly Litvak, Marina Sokol, and Don Towsley Ranking and Sparsifying a Connection Graph Fan Chung and Wenbo Zhao A Game-Theoretic Model of Attention in Social Networks Ashish Goel and Farnaz Ronaghi On Certain Properties of Random Apollonian Networks Alan Frieze and Charalampos E. Tsourakakis Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional Links Yanhua Li, Zhi-Li Zhang, and Jie Bao Dynamic PageRank Using Evolving Teleportation Ryan A. Rossi and David F. Gleich Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors Fan Chung, Paul Horn, and Jacob Hughes

6 VIII Table of Contents Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs Jaideep Ray, Ali Pinar, and C. Seshadhri A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence Colin Cooper, Tomasz Radzik, and Yiannis Siantos Author Index