Borrow it
 Architecture Library
 Bizzell Memorial Library
 Boorstin Collection
 Chinese Literature Translation Archive
 Engineering Library
 Fine Arts Library
 Harry W. Bass Business History Collection
 History of Science Collections
 John and Mary Nichols Rare Books and Special Collections
 Library Service Center
 Price College Digital Library
 Western History Collections
The Resource Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)
Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)
Resource Information
The item Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Oklahoma Libraries.
This item is available to borrow from all library branches.
 Summary
 This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms and Models for the Web Graph, WAW 2014, held in Beijing, China, in December 2014. The 12 papers presented were carefully reviewed and selected for inclusion in this volume. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of highperformance algorithms and applications that exploit these graphs. The workshop gathered the researchers who are working on graphtheoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet
 Language
 eng
 Extent
 1 online resource (ix, 161 pages)
 Note
 Includes author index
 Contents

 Intro; Preface; Organization; Contents; Clustering and the Hyperbolic Geometry of Complex Networks; 1 Introduction; 1.1 Random Geometric Graphs on the Hyperbolic Plane; 1.2 Notation; 2 Some Geometric Aspects of the Two Models; 3 The Clustering Coefficient; 4 Conclusions; References; Burning a Graph as a Model of Social Contagion; 1 Introduction; 2 Properties of the Burning Number; 2.1 Characterizations of Burning Number via Trees; 2.2 Bounds; 3 Burning in the ILT Model; 4 Cartesian Grids; 5 Conclusions and Future Work; References; Personalized PageRank with NodeDependent Restart
 1 Introduction and Definitions2 OccupationTime Personalized PageRank; 3 LocationofRestart Personalized PageRank; 4 Interesting Particular Cases; 4.1 Constant Probability of Restart; 4.2 Restart Probabilities Proportional to Powers of Degrees; 4.3 Random Walk with Jumps; 5 Discussion; References; Efficient Computation of the Weighted Clustering Coefficient; 1 Introduction; 1.1 Related Works; 2 Preliminaries; 2.1 Generalizations of Clustering Coefficient in Weighted Networks; 3 Computing the Weighted Clustering Coefficient in Probabilistic Networks
 4 Efficient Estimators for the Weighted Clustering Coefficient5 Experiments; References; Global Clustering Coefficient in ScaleFree Networks; 1 Introduction; 2 Clustering Coefficients; 3 ScaleFree Graphs; 4 Existence of a Graph with Given Degree Distribution; 4.1 Result; 4.2 Auxiliary Results; 4.3 Proof of Theorem 1; 5 Global Clustering Coefficient; 5.1 Result; 5.2 Proof of Theorem 4; 6 Experiments; 7 Conclusion; References; Efficient PrimalDual Graph Algorithms for MapReduce; 1 Introduction; 1.1 Problem Formulations and Results; 1.2 Technique: Width Modulation; 1.3 Related Work
 2 Undirected Densest Subgraph2.1 Linear Program and Duality; 2.2 Width Modulation; 2.3 Binary Search for D*; 2.4 Rounding Step: Recovering the Densest Subgraph; 2.5 Summary of the Algorithm; 2.6 Number of MapReduce Phases; References; A The Multiplicative Weights Update Framework; B Densest Subgraph in Directed Graphs; B.1 Parametric LP Formulation; B.2 Covering Program and Width Modulation; B.3 Parametric Search; B.4 Rounding Step: Recovering the Densest Subgraph; C Fractional Matchings in Bipartite Graphs; C.1 Covering Program, Width Modulation, and Binary Search
 C.2 Rounding Step: Recovering the Fractional MatchingReferences; Computing Diffusion State Distance Using Green's Function and Heat Kernel on Graphs; 1 Introduction; 2 Notation and Background; 3 Proof of Main Theorem; 4 Some Examples of the DSD Distance; 4.1 The Path Pn; 4.2 The Cycle Cn; 4.3 The Hypercube Qn; 5 Random Graphs; 6 Examples of Biological Networks; References; Relational Topic Factorization for Link Prediction in Document Networks; 1 Introduction; 2 Related Work; 3 Proposed Model; 3.1 Relational Topic Factorization; 3.2 Learning the Parameters; 4 Empirical Results; 4.1 Dataset
 Isbn
 9783319131238
 Label
 Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings
 Title
 Algorithms and models for the web graph
 Title remainder
 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings
 Statement of responsibility
 Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)
 Title variation
 WAW 2014
 Language
 eng
 Summary
 This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms and Models for the Web Graph, WAW 2014, held in Beijing, China, in December 2014. The 12 papers presented were carefully reviewed and selected for inclusion in this volume. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of highperformance algorithms and applications that exploit these graphs. The workshop gathered the researchers who are working on graphtheoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet
 Cataloging source
 NLGGC
 Dewey number
 004.67/8
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.9.A43
 LC item number
 W425 2014
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2014
 http://bibfra.me/vocab/lite/meetingName
 WAW (Workshop)
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorDate

 1971
 1949
 http://library.link/vocab/relatedWorkOrContributorName

 Bonato, Anthony
 Chung, Fan R. K.
 Prałat, Paweł
 Series statement

 Lecture Notes in Computer Science,
 LNCS sublibrary. SL 1, Theoretical computer science and general issues
 Series volume
 8882
 http://library.link/vocab/subjectName

 Computer algorithms
 Data mining
 World Wide Web
 Computer algorithms
 Data mining
 World Wide Web
 Engineering & Applied Sciences
 Computer Science
 Label
 Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)
 Note
 Includes author index
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Content category

 text
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Preface; Organization; Contents; Clustering and the Hyperbolic Geometry of Complex Networks; 1 Introduction; 1.1 Random Geometric Graphs on the Hyperbolic Plane; 1.2 Notation; 2 Some Geometric Aspects of the Two Models; 3 The Clustering Coefficient; 4 Conclusions; References; Burning a Graph as a Model of Social Contagion; 1 Introduction; 2 Properties of the Burning Number; 2.1 Characterizations of Burning Number via Trees; 2.2 Bounds; 3 Burning in the ILT Model; 4 Cartesian Grids; 5 Conclusions and Future Work; References; Personalized PageRank with NodeDependent Restart
 1 Introduction and Definitions2 OccupationTime Personalized PageRank; 3 LocationofRestart Personalized PageRank; 4 Interesting Particular Cases; 4.1 Constant Probability of Restart; 4.2 Restart Probabilities Proportional to Powers of Degrees; 4.3 Random Walk with Jumps; 5 Discussion; References; Efficient Computation of the Weighted Clustering Coefficient; 1 Introduction; 1.1 Related Works; 2 Preliminaries; 2.1 Generalizations of Clustering Coefficient in Weighted Networks; 3 Computing the Weighted Clustering Coefficient in Probabilistic Networks
 4 Efficient Estimators for the Weighted Clustering Coefficient5 Experiments; References; Global Clustering Coefficient in ScaleFree Networks; 1 Introduction; 2 Clustering Coefficients; 3 ScaleFree Graphs; 4 Existence of a Graph with Given Degree Distribution; 4.1 Result; 4.2 Auxiliary Results; 4.3 Proof of Theorem 1; 5 Global Clustering Coefficient; 5.1 Result; 5.2 Proof of Theorem 4; 6 Experiments; 7 Conclusion; References; Efficient PrimalDual Graph Algorithms for MapReduce; 1 Introduction; 1.1 Problem Formulations and Results; 1.2 Technique: Width Modulation; 1.3 Related Work
 2 Undirected Densest Subgraph2.1 Linear Program and Duality; 2.2 Width Modulation; 2.3 Binary Search for D*; 2.4 Rounding Step: Recovering the Densest Subgraph; 2.5 Summary of the Algorithm; 2.6 Number of MapReduce Phases; References; A The Multiplicative Weights Update Framework; B Densest Subgraph in Directed Graphs; B.1 Parametric LP Formulation; B.2 Covering Program and Width Modulation; B.3 Parametric Search; B.4 Rounding Step: Recovering the Densest Subgraph; C Fractional Matchings in Bipartite Graphs; C.1 Covering Program, Width Modulation, and Binary Search
 C.2 Rounding Step: Recovering the Fractional MatchingReferences; Computing Diffusion State Distance Using Green's Function and Heat Kernel on Graphs; 1 Introduction; 2 Notation and Background; 3 Proof of Main Theorem; 4 Some Examples of the DSD Distance; 4.1 The Path Pn; 4.2 The Cycle Cn; 4.3 The Hypercube Qn; 5 Random Graphs; 6 Examples of Biological Networks; References; Relational Topic Factorization for Link Prediction in Document Networks; 1 Introduction; 2 Related Work; 3 Proposed Model; 3.1 Relational Topic Factorization; 3.2 Learning the Parameters; 4 Empirical Results; 4.1 Dataset
 Extent
 1 online resource (ix, 161 pages)
 Form of item
 online
 Isbn
 9783319131238
 Media category

 computer
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Note
 SpringerLink
 Other control number
 10.1007/9783319131238
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number

 (OCoLC)897803040
 (OCoLC)ocn897803040
 Label
 Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)
 Note
 Includes author index
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Content category

 text
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Preface; Organization; Contents; Clustering and the Hyperbolic Geometry of Complex Networks; 1 Introduction; 1.1 Random Geometric Graphs on the Hyperbolic Plane; 1.2 Notation; 2 Some Geometric Aspects of the Two Models; 3 The Clustering Coefficient; 4 Conclusions; References; Burning a Graph as a Model of Social Contagion; 1 Introduction; 2 Properties of the Burning Number; 2.1 Characterizations of Burning Number via Trees; 2.2 Bounds; 3 Burning in the ILT Model; 4 Cartesian Grids; 5 Conclusions and Future Work; References; Personalized PageRank with NodeDependent Restart
 1 Introduction and Definitions2 OccupationTime Personalized PageRank; 3 LocationofRestart Personalized PageRank; 4 Interesting Particular Cases; 4.1 Constant Probability of Restart; 4.2 Restart Probabilities Proportional to Powers of Degrees; 4.3 Random Walk with Jumps; 5 Discussion; References; Efficient Computation of the Weighted Clustering Coefficient; 1 Introduction; 1.1 Related Works; 2 Preliminaries; 2.1 Generalizations of Clustering Coefficient in Weighted Networks; 3 Computing the Weighted Clustering Coefficient in Probabilistic Networks
 4 Efficient Estimators for the Weighted Clustering Coefficient5 Experiments; References; Global Clustering Coefficient in ScaleFree Networks; 1 Introduction; 2 Clustering Coefficients; 3 ScaleFree Graphs; 4 Existence of a Graph with Given Degree Distribution; 4.1 Result; 4.2 Auxiliary Results; 4.3 Proof of Theorem 1; 5 Global Clustering Coefficient; 5.1 Result; 5.2 Proof of Theorem 4; 6 Experiments; 7 Conclusion; References; Efficient PrimalDual Graph Algorithms for MapReduce; 1 Introduction; 1.1 Problem Formulations and Results; 1.2 Technique: Width Modulation; 1.3 Related Work
 2 Undirected Densest Subgraph2.1 Linear Program and Duality; 2.2 Width Modulation; 2.3 Binary Search for D*; 2.4 Rounding Step: Recovering the Densest Subgraph; 2.5 Summary of the Algorithm; 2.6 Number of MapReduce Phases; References; A The Multiplicative Weights Update Framework; B Densest Subgraph in Directed Graphs; B.1 Parametric LP Formulation; B.2 Covering Program and Width Modulation; B.3 Parametric Search; B.4 Rounding Step: Recovering the Densest Subgraph; C Fractional Matchings in Bipartite Graphs; C.1 Covering Program, Width Modulation, and Binary Search
 C.2 Rounding Step: Recovering the Fractional MatchingReferences; Computing Diffusion State Distance Using Green's Function and Heat Kernel on Graphs; 1 Introduction; 2 Notation and Background; 3 Proof of Main Theorem; 4 Some Examples of the DSD Distance; 4.1 The Path Pn; 4.2 The Cycle Cn; 4.3 The Hypercube Qn; 5 Random Graphs; 6 Examples of Biological Networks; References; Relational Topic Factorization for Link Prediction in Document Networks; 1 Introduction; 2 Related Work; 3 Proposed Model; 3.1 Relational Topic Factorization; 3.2 Learning the Parameters; 4 Empirical Results; 4.1 Dataset
 Extent
 1 online resource (ix, 161 pages)
 Form of item
 online
 Isbn
 9783319131238
 Media category

 computer
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Note
 SpringerLink
 Other control number
 10.1007/9783319131238
 Other physical details
 illustrations.
 Specific material designation
 remote
 System control number

 (OCoLC)897803040
 (OCoLC)ocn897803040
Subject
 Computer Science
 Computer algorithms
 Computer algorithms  Congresses
 Conference papers and proceedings
 Data mining
 Data mining  Congresses
 Engineering & Applied Sciences
 World Wide Web
 World Wide Web  Congresses
Genre
Member of
 LNCS sublibrary, SL 1, Theoretical computer science and general issues
 Lecture notes in computer science, 8882.
Library Locations

Architecture LibraryBorrow itGould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US35.205706 97.445050



Chinese Literature Translation ArchiveBorrow it401 W. Brooks St., RM 414, Norman, OK, 73019, US35.207487 97.447906

Engineering LibraryBorrow itFelgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US35.205706 97.445050

Fine Arts LibraryBorrow itCatlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US35.210371 97.448244

Harry W. Bass Business History CollectionBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

History of Science CollectionsBorrow it401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US35.207487 97.447906

John and Mary Nichols Rare Books and Special CollectionsBorrow it401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US35.207487 97.447906


Price College Digital LibraryBorrow itAdams Hall 102 307 West Brooks St., Norman, OK, 73019, US35.210371 97.448244

Western History CollectionsBorrow itMonnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US35.209584 97.445414
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/Algorithmsandmodelsforthewebgraph11th/bhPhkX5RUIE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/Algorithmsandmodelsforthewebgraph11th/bhPhkX5RUIE/">Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/portal/Algorithmsandmodelsforthewebgraph11th/bhPhkX5RUIE/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/portal/Algorithmsandmodelsforthewebgraph11th/bhPhkX5RUIE/">Algorithms and models for the web graph : 11th International Workshop, WAW 2014, Beijing, China, December 1718, 2014 : proceedings, Anthony Bonato, Fan Chung Graham, Paweł Prałat (Eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>