Graph Models for Complex Networks

• 
  Kevin J. Lang: Information Theoretic Comparison of Stochastic Graph Models: Some Experiments. 1-12
• 
  Mira Gonen, Yuval Shavitt: Approximating the Number of Network Motifs. 13-24
• 
  Reid Andersen, Kumar Chellapilla: Finding Dense Subgraphs with Size Bounds. 25-37
• 
  Fan Chung Graham, Paul Horn, Linyuan Lu: The Giant Component in a Random Subgraph of a Given Graph. 38-49
• 
  Fernando Mourão, Leonardo C. da Rocha, Lucas Miranda, Virgílio A. F. Almeida, Wagner Meira Jr.: Quantifying the Impact of Information Aggregation on Complex Networks: A Temporal Perspective. 50-61

PageRank and Web Graph

• 
  Fan Chung Graham: A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank. 62-75
• 
  Marco Bressan, Enoch Peserico: Choose the Damping, Choose the Ranking?. 76-89
• 
  Nelly Litvak, Werner R. W. Scheinhardt, Yana Volkovich, Bert Zwart: Characterization of Tail Dependence for In-Degree and PageRank. 90-103
• 
  Polyxeni Zacharouli, Michalis K. Titsias, Michalis Vazirgiannis: Web Page Rank Prediction with PCA and EM Clustering. 104-115
• 
  Paolo Boldi, Massimo Santini, Sebastiano Vigna: Permuting Web Graphs. 116-126

Social Networks and Search

• 
  Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang: A Dynamic Model for On-Line Social Networks. 127-142
• 
  Antonio Gulli, Stefano Cataudella, Luca Foschini: TC-SocialRank: Ranking the Social Web. 143-154
• 
  Maarten Clements, Arjen P. de Vries, Marcel J. T. Reinders: Exploiting Positive and Negative Graded Relevance Assessments for Content Recommendation. 155-166
• 
  Hyun Chul Lee, Allan Borodin: Cluster Based Personalized Search. 167-183

last updated on Sat May 18 05:42:32 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page