Abstract is missing.
- Information Theoretic Comparison of Stochastic Graph Models: Some ExperimentsKevin J. Lang. 1-12 [doi]
- Approximating the Number of Network MotifsMira Gonen, Yuval Shavitt. 13-24 [doi]
- Finding Dense Subgraphs with Size BoundsReid Andersen, Kumar Chellapilla. 25-37 [doi]
- The Giant Component in a Random Subgraph of a Given GraphFan Chung Graham, Paul Horn, Linyuan Lu. 38-49 [doi]
- Quantifying the Impact of Information Aggregation on Complex Networks: A Temporal PerspectiveFernando Mourão, Leonardo C. da Rocha, Lucas Miranda, Virgílio A. F. Almeida, Wagner Meira Jr.. 50-61 [doi]
- A Local Graph Partitioning Algorithm Using Heat Kernel PagerankFan Chung Graham. 62-75 [doi]
- Choose the Damping, Choose the Ranking?Marco Bressan 0002, Enoch Peserico. 76-89 [doi]
- Characterization of Tail Dependence for In-Degree and PageRankNelly Litvak, Werner R. W. Scheinhardt, Yana Volkovich, Bert Zwart. 90-103 [doi]
- Web Page Rank Prediction with PCA and EM ClusteringPolyxeni Zacharouli, Michalis Titsias, Michalis Vazirgiannis. 104-115 [doi]
- Permuting Web GraphsPaolo Boldi, Massimo Santini, Sebastiano Vigna. 116-126 [doi]
- A Dynamic Model for On-Line Social NetworksAnthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat, Changping Wang. 127-142 [doi]
- TC-SocialRank: Ranking the Social WebAntonio Gulli, Stefano Cataudella, Luca Foschini. 143-154 [doi]
- Exploiting Positive and Negative Graded Relevance Assessments for Content RecommendationMaarten Clements, Arjen P. de Vries, Marcel J. T. Reinders. 155-166 [doi]
- Cluster Based Personalized SearchHyun-Chul Lee, Allan Borodin. 167-183 [doi]