BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A Weighted Spectrum Metric for Comparison of Internet Topologies -
  Damien Fay (University of Cambridge)
DTSTART:20080508T150000Z
DTEND:20080508T160000Z
UID:TALK11824@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:Comparison of graph structures is a frequently encountered pro
 blem across a number of problem domains. Comparing graphs requires a metri
 c to discriminate which features of the graphs are considered important. T
 he spectrum of a graph is often claimed to contain all the information wit
 hin a graph\, but the raw spectrum contains too much information to be dir
 ectly used as a useful metric. In this paper we introduce a metric\, the w
 eighted spectral distribution\, that improves on the raw spectrum by disco
 unting those eigen-values believed to be unimportant and emphasizing the c
 ontribution of those believed to be important.\n\nBio: Damien Fay received
  a BEng in electronic engineering from University College Dublin in 1995\,
  a masters from Dublin City university in 1997 and a PhD in time series fo
 recasting from Dublin City university in 2003. From 2003 to 2007 Damien le
 ctured in the mathematics department at the National University of Ireland
 \, Galway. In October 2007 he joined the NetOS group at the Computer Labor
 atory\, Cambridge as a research associate with Andrew Moore. His current i
 nterests are quite varied ranging from time series analysis for engineerin
 g and financial applications to graph theory applied to computer networks.
 \n
LOCATION:Lecture Theatre 2\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR
