Abstract is missing.
- Hypergraph Coloring Games and Voter ModelsFan R. K. Chung, Alexander Tsiatas. 1-16 [doi]
- On a DAG Partitioning ProblemSoroush Alamdari, Abbas Mehrabian. 17-28 [doi]
- Some Typical Properties of the Spatial Preferred Attachment ModelColin Cooper, Alan M. Frieze, Pawel Pralat. 29-40 [doi]
- A Sublinear Time Algorithm for PageRank ComputationsChristian Borgs, Michael Brautbar, Jennifer T. Chayes, Shang-Hua Teng. 41-53 [doi]
- Quick Detection of Nodes with Large DegreesKonstantin Avrachenkov, Nelly Litvak, Marina Sokol, Don Towsley. 54-65 [doi]
- Ranking and Sparsifying a Connection GraphFan Chung Graham, Wenbo Zhao. 66-77 [doi]
- A Game-Theoretic Model of Attention in Social NetworksAshish Goel, Farnaz Ronaghi. 78-92 [doi]
- On Certain Properties of Random Apollonian NetworksAlan M. Frieze, Charalampos E. Tsourakakis. 93-112 [doi]
- Mutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional LinksYanhua Li, Zhi-Li Zhang, Jie Bao. 113-125 [doi]
- Dynamic PageRank Using Evolving TeleportationRyan A. Rossi, David F. Gleich. 126-137 [doi]
- Multi-commodity Allocation for Dynamic Demands Using PageRank VectorsFan R. K. Chung, Paul Horn, Jacob Hughes. 138-152 [doi]
- Are We There Yet? When to Stop a Markov Chain while Generating Random GraphsJaideep Ray, Ali Pinar, C. Seshadhri. 153-164 [doi]
- A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree SequenceColin Cooper, Tomasz Radzik, Yiannis Siantos. 165-178 [doi]