BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Sampling Theory of Large Graphs - John C.S. Lui (Chinese Universit
 y of Hong Kong)
DTSTART:20140704T100000Z
DTEND:20140704T110000Z
UID:TALK53246@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:Characterizing user pair relationships is important for applic
 ations such as friend recommendation and interest targeting in online soci
 al networks (OSNs). Due to the large scale nature of such networks\, it is
  infeasible to enumerate all user pairs and so sampling is used. In this t
 alk\, we show that it is a great challenge even for OSN service providers 
 to characterize user pair relationships even when they posses the complete
  graph topology. The reason is that when sampling techniques (i.e.\, unifo
 rm vertex sampling (UVS) and random walk (RW)) are naively applied\, they 
 can introduce large biases\, in particular\, for estimating similarity dis
 tribution of user pairs with constraints such as existence of mutual neigh
 bors\, which is important for applications such as identifying network hom
 ophily. Estimating statistics of user pairs is more challenging in the abs
 ence of the complete topology information\, since an unbiased sampling tec
 hnique such as UVS is usually not allowed\, and exploring the OSN graph to
 pology is expensive. To address these challenges\, we present asymptotical
 ly unbiased sampling methods to characterize user pair properties based on
  UVS and RW techniques respectively.\n\nBio: John C.S. Lui was born in Hon
 g Kong and is currently a full professor in the Department of Computer Sci
 ence & Engineering at The Chinese University of Hong Kong. He received his
  Ph.D. in Computer Science from UCLA.  After his graduation\, he joined th
 e IBM Almaden Research Laboratory/San Jose Laboratory and participated in 
 various research and development projects on file systems and parallel I/O
  architectures. He later joined the Department of Computer Science and Eng
 ineering at The Chinese University of Hong Kong.  His current research int
 erests are in Internet\, network sciences with large data implications (e.
 g.\, online social networks\, large scale data analytics\,..etc)\, network
 /system security (e.g.\, cloud security\, mobile security\, ...etc)\, netw
 ork economics\, large scale distributed systems and performance evaluation
  theory.  John served as the chairman of the CSE Department from 2005-2011
 . He received various departmental teaching awards and the CUHK Vice-Chanc
 ellor's Exemplary Teaching Award. John received the CUHK Faculty of Engine
 ering Research Excellence Award (2011-2012). John is a co-recipient of the
  IFIP WG 7.3 Performance 2005 and IEEE/IFIP NOMS 2006 Best Student Paper A
 wards. He is an elected member of the IFIP WG 7.3\, Fellow of ACM\, Fellow
  of IEEE\, Senior Research Fellow of the Croucher Foundation and is curren
 tly the chair of the ACM SIGMETRICS. His personal interests include films 
 and general reading.\n
LOCATION:FW26\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR