Determining Factors Behind the PageRank Log-Log Plot
We study the relation between PageRank and other parameters of information networks such as in-degree, out-degree, and the fraction of dangling nodes. We model this relation through a stochastic equation inspired by the original definition of PageRank. Fu
- PDF / 8,579,365 Bytes
- 226 Pages / 430.15 x 660.926 pts Page_size
- 4 Downloads / 193 Views
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 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 University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
4863
Anthony Bonato Fan R.K. Chung (Eds.)
Algorithms and Models for the Web-Graph 5th International Workshop, WAW 2007 San Diego, CA, USA, December 11-12, 2007 Proceedings
13
Volume Editors Anthony Bonato Wilfrid Laurier University, Department of Mathematics Waterloo, ON, N2L 3C5, Canada E-mail: [email protected] Fan R.K. Chung University of California, San Diego, Department of Mathematics La Jolla, CA 92093-0112, USA E-mail: [email protected]
Library of Congress Control Number: 2007939821 CR Subject Classification (1998): F.2, G.2, H.4, H.3, C.2, H.2.8, E.1 LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues ISSN ISBN-10 ISBN-13
0302-9743 3-540-77003-8 Springer Berlin Heidelberg New York 978-3-540-77003-9 Springer Berlin Heidelberg New York
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. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2007 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12197316 06/3180 543210
Preface
This volume constitutes the refereed proceedings of the Fifth Workshop on Algorithms and Models for the Web-Graph, WAW 2007, held in San Diego in December 2007. The proceedings consist of 18 revised papers (13 regular papers and 5 short papers) which were reviewed and selected from a large pool of submissions. The papers address a wide variety of topics related to the study of the Web-graph such as random graph models for the Web-graph, PageRank analysis and computation, decentralized search, local partitioning algorithms, and traceroute sampling. The Web-grap
Data Loading...
