Algorithms and Models for the Web Graph: 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016, Proceedings PDF
Preview Algorithms and Models for the Web Graph: 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016, Proceedings
Anthony Bonato Fan Chung Graham Paweł Prałat (Eds.) 8 8 0 Algorithms and Models 0 1 S C for the Web Graph N L 13th International Workshop, WAW 2016 Montreal, QC, Canada, December 14–15, 2016 Proceedings 123 Lecture Notes in Computer Science 10088 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, 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, Zurich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Anthony Bonato Fan Chung Graham (cid:129) ł ł Pawe Pra at (Eds.) Algorithms and Models for the Web Graph 13th International Workshop, WAW 2016 – Montreal, QC, Canada, December 14 15, 2016 Proceedings 123 Editors Anthony Bonato Paweł Prałat Ryerson University Ryerson University Toronto Toronto Canada Canada FanChung Graham University of California San Diego LaJolla, CA USA ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-49786-0 ISBN978-3-319-49787-7 (eBook) DOI 10.1007/978-3-319-49787-7 LibraryofCongressControlNumber:2015954997 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerInternationalPublishingAG2016 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade. Printedonacid-freepaper ThisSpringerimprintispublishedbySpringerNature TheregisteredcompanyisSpringerInternationalPublishingAG Theregisteredcompanyaddressis:Gewerbestrasse11,6330Cham,Switzerland Preface The13thWorkshoponAlgorithmsandModelsfortheWebGraph(WAW2016)took placeattheCentredeRecherchesMathématiques,Montréal,Canada,December14–15, 2016.Thisisanannualmeeting,whichistraditionallyco-locatedwithanother,related, conference.WAW2016wasco-locatedwiththe12thConferenceonWebandInternet Economics (WINE 2016). Co-location of the workshop and conference provided opportunities for researchers in two different but interrelated areas to interact and to exchangeresearchideas.Itwasaneffectivevenueforthedisseminationofnewresultsand forfosteringresearchcollaboration. TheWorldWideWebhasbecomepartofoureverydaylife,andinformationretrieval and data mining on the Web are now of enormous practical interest. The algorithms supporting these activities combine the view of the Web as a text repository and as a graph,inducedinvariouswaysbylinksamongpages,hosts,andusers.Theaimofthe workshop was to further the understanding of graphs that arise from the Web and varioususeractivitiesontheWeb,andstimulatethedevelopmentofhigh-performance algorithmsandapplicationsthatexploitthesegraphs.Theworkshopgatheredtogether researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, andother networks arising from theInternet. Thisvolumecontainsthepaperspresentedduringtheworkshop.Eachsubmissionwas reviewedbyProgramCommitteemembers.Paperswere submittedandreviewedusing theEasyChaironlinesystem.Thecommitteemembersdecidedtoaccept13papers. December 2016 Anthony Bonato Fan Chung Graham Paweł Prałat Organization General Chairs Andrei Z. Broder Google Research, USA Fan Chung Graham University of California San Diego, USA Organizing Committee Anthony Bonato Ryerson University, Canada Fan Chung Graham University of California, San Diego, USA Paweł Prałat Ryerson University, Canada Sponsoring Institutions Centre de Recherches Mathématiques Google Internet Mathematics Ryerson University Yandex Program Committee Konstantin Avratchenkov Inria, France Paolo Boldi University of Milan, Italy Anthony Bonato Ryerson University, Canada Milan Bradonjic Bell Laboratories, USA Michael Brautbar Toast, Inc., USA Fan Chung Graham UC San Diego, USA Collin Cooper King’s College London, UK Andrzej Dudek Western Michigan University, USA Alan Frieze Carnegie Mellon University, USA David Gleich Purdue University, USA Jeannette Janssen Dalhousie University, Canada Julia Komjathy EindhovenUniversityofTechnology,TheNetherlands Ravi Kumar Google, USA Silvio Lattanzi Google, USA Marc Lelarge Inria, France Stefano Leonardi Sapienza University of Rome, Italy Nelly Litvak University of Twente, The Netherlands Michael Mahoney UC Berkeley, USA VIII Organization Oliver Mason NUI Maynooth, Ireland Dieter Mitsche University of Nice Sophia-Antipolis, France Peter Morters University of Bath, UK Tobias Mueller Utrecht University, The Netherlands Liudmila Ostroumova Yandex, Russia Pan Peng TU Dortmund, Germany Xavier Perez-Gimenez University of Nebraska-Lincoln, USA Paweł Prałat Ryerson University, Canada Yana Volkovich AppNexus, USA Stephen Young Pacific Northwest National Laboratory, USA Contents An Upper Bound on the Burning Number of Graphs. . . . . . . . . . . . . . . . . . 1 Max R. Land and Linyuan Lu Assortativity in Generalized Preferential Attachment Models . . . . . . . . . . . . 9 Alexander Krot and Liudmila Ostroumova Prokhorenkova Diclique Clustering in a Directed Random Graph . . . . . . . . . . . . . . . . . . . . 22 Mindaugas Bloznelis and Lasse Leskelä Distributed and Asynchronous Methods for Semi-supervised Learning. . . . . . 34 Konstantin Avrachenkov, Vivek S. Borkar, and Krishnakant Saboo Existence and Region of Critical Probabilities in Bootstrap Percolation on Inhomogeneous Periodic Trees. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 Milan Bradonjić and Stephan Wagner FastApproximationAlgorithmsforp-centersinLarged-hyperbolicGraphs ... 60 Katherine Edwards, Sean Kennedy, and Iraj Saniee Graphon-InspiredAnalysisontheFluctuationoftheChineseStockMarket.... 74 Linyuan Lu, Arthur L.B. Yang, and James J.Y. Zhao Max Celebrity Games . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88 C. Àlvarez and A. Messeguè Mining and Modeling Character Networks. . . . . . . . . . . . . . . . . . . . . . . . . 100 Anthony Bonato, David Ryan D’Angelo, Ethan R. Elenberg, David F. Gleich, and Yangyang Hou Modularity of Complex Networks Models . . . . . . . . . . . . . . . . . . . . . . . . . 115 Liudmila Ostroumova Prokhorenkova, Paweł Prałat, and Andrei Raigorodskii On Mixing in Pairwise Markov Random Fields with Application to Social Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 Konstantin Avrachenkov, Lenar Iskhakov, and Maksim Mironov X Contents Subgraphs in Non-uniform Random Hypergraphs . . . . . . . . . . . . . . . . . . . . 140 Megan Dewar, John Healy, Xavier Pérez-Giménez, Paweł Prałat, John Proos, Benjamin Reiniger, and Kirill Ternovsky TheSpreadofCooperativeStrategiesonGridswithRandomAsynchronous Updating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152 Christopher Duffy and Jeannette Janssen Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
The list of books you might like
