
Algorithms and Models for the Web-Graph
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
The 13 revised full papers presented together with 1 invited lecture were carefully reviewed and selected from 19 submissions. Addressing a wide variety of topics related to the study of the Web-graph such as theoretical and empirical analysis, the papers feature original research in terms of algorithmic and mathematical analysis in all areas pertaining to the World-Wide Web with special focus to the view of complex data as networks.
More details
Other editions
Additional editions

Content
- Title Page
- Preface
- Organization
- Table of Contents
- A Spectral Algorithm for Computing Social Balance
- Introduction
- Related Work
- Basics
- Balanced Triangles in Complete Networks
- Balanced Triangles in Arbitrary Networks
- Experiments
- Evaluating Spectral on Real-World Signed Networks
- Evaluating Spectral on Synthetic Signed Networks
- Conclusions
- References
- High-Ordered Random Walks and Generalized Laplacians on Hypergraphs
- Introduction
- Definition of the s-th Laplacian
- Case 1 = s = r/2
- The Case r/2 & s = r - 1
- Examples
- Properties of Laplacians
- Applications
- The Random s-Walks on Hypergraphs
- The s-Distances and s-Diameters in Hypergraphs
- The Edge Expansions in Hypergraphs
- Concluding Remarks
- References
- Detecting the Structure of Social Networks Using ($a, ß$)-Communities
- Introduction
- Preliminaries
- Experimental Results
- Social Graphs
- Random Graphs
- Conclusion
- References
- Latent Clustering on Graphs with Multiple Edge Types
- Introduction
- Contributions
- An Illustrative Problem
- Background
- Clustering
- Variation of Information of Clusterings
- Previous Work
- Searching the Space of Clusterings
- Sampling the Clustering Space
- Meta-clusters: Clusters of Clusterings
- Efficient Representation of the Clusterings
- Averaging Clusterings within a Cluster
- Ordering by Set-Wise Information Content
- Physics Articles from arXiv.org
- Conclusion and Future Work
- References
- Quick Detection of Top-k Personalized PageRank Lists
- Introduction
- Monte Carlo Methods
- Variance Based Performance Comparison and CLT Approximations
- Convergence Based on Order
- Solution Relaxation
- References
- Rank-Based Models of Network Structure and the Discovery of Content
- Why Network Content Matters
- A Rank Model of Content
- Model Overview
- Ranking by Age
- Randomly Chosen Initial Rank
- A Rank Model of Network Structure
- The Discovery of Content through Structure
- Conclusion
- References
- 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
- Introduction
- Basic Definition and Useful Facts
- Algorithm
- Correctness Proof
- Conclusion
- References
- Modeling Social Networks through User Background and Behavior
- Introduction
- The Model
- Metrics
- Results: Undirected Networks
- Results: Directed Networks
- Comparison with the Forest Fire Model
- Some Analytical Observations
- Conclusions and Open Problems
- References
- Dirichlet PageRank and Trust-Based Ranking Algorithms
- Introduction
- Related Work
- Results in This Paper
- Several Applications of Dirichlet PageRank
- Preliminaries
- PageRank with Dirichlet Boundary Conditions
- Dirichlet PageRank with Given Boundary Conditions
- Algorithms and Analysis
- Applications of Dirichlet PageRank
- Adjusting Spammers' Influence
- Adjusting Rank Based on Trust
- References
- Efficient Generation of Networks with Given Expected Degrees
- Introduction
- Model Description
- Erdos-Rényi Case
- Chung-Lu Case
- Efficiency
- Examples
- Discussion
- References
- Author Index
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.