9th Workshop on Algorithms and Models for the Web Graph

Dalhousie University in Halifax, Nova Scotia, Canada

June 22-23, 2012


Pre-conference: Thursday, June 21: 1pm – Ricardo Baeza-Yates – MoMiNIS seminar (Slonim Room)

Bold face indicates speaker. All talks take place in the Slonim Room (430) of the Computer Science Building except where noted below.

Friday June 22Saturday June 23
8:45–9:00 Opening remarks  
9:00–10:00 Jennifer ChayesInvited lecture and MoMiNIS seminar
Auditorium (127)
Nelly LitvakInvited lecture and MoMiNIS seminar
10:00–10:30 Coffee (Atrium)
10:30–11:00 Michael Brautbar, Jennifer Chayes, Christian Borgs and Shang-Hua TengSublinear Time Algorithm for PageRank Computations and Related Applications Fan Chung Graham and Alexander TsiatasHypergraph coloring games and voter models
11:00–11:30 Ryan Rossi and David GleichDynamic PageRank using Evolving Teleportation Soroush Alamdari and Abbas MehrabianOn a DAG Partitioning Problem
11:30–12:00 Fan Chung, Paul Horn and Jacob HughesMulti-commodity allocation for dynamic demands using PageRank vectors Fan Chung Graham, Mark Kempton, and Wenbo ZhaoRanking and sparsifying a connection graph
12:00–12:30 Jaideep Ray, Ali Pinar and C SeshadriAre we there yet? When to stop a Markov chain while generating random graphs Ashish Goel and Farnaz RonaghiA Game-theoretic Model of Attention in Social Networks
12:30–1:30 Lunch (Atrium) Conference ends
1:30–2:00 Alan Frieze and Charalampos TsourakakisOn Certain Properties of Random Apollonian Networks  
2:00–2:30 Colin Cooper, Alan Frieze and Pawel PralatSome typical properties of the Spatial Preferred Attachment model
2:30–3:00 Yanhua Li, Zhi-Li Zhang and Jie BaoMutual or Unrequited Love: Identifying Stable Clusters in Social Networks with Uni- and Bi-directional Links
3:00–3:15 Coffee (Atrium)
3:15–3:45 Colin Cooper, Yiannis Siantos and Tomasz RadzikA fast algorithm to find all high degree vertices in graphs with a power law degree sequence
3:45–4:15 Konstantin Avrachenkov, Nelly Litvak, Marina Sokol and Don TowsleyQuick Detection of Nodes with Large Degrees
4:15–5:00 Posters        
Hidetoshi Shimodaira and Haruhisa Nagata A Laplacian for the personalized PageRank of undirected graph
Tsuyoshi Murata Generic Modularity for Heterogeneous Networks
Rory Wilson, Jeannette Janssen and Pawel Pralat Estimating Node Similarity in an Asymmetric Spatial Graph Model
Dieter Mitsche, Anthony Bonato, and Pawel Pralat Seepage - Vertex pursuit in random directed acyclic graphs
Douglas Stones, Xin Li, Haidong Wang, Hualiang Deng, Xiaoguang Liu and Gang WangNetMODE: a new package for network motif detection
5:00 Reception: Wine and Cheese