University of Cambridge > Talks.cam > Computer Laboratory Systems Research Group Seminar > A Weighted Spectrum Metric for Comparison of Internet Topologies

A Weighted Spectrum Metric for Comparison of Internet Topologies

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Eiko Yoneki.

Comparison of graph structures is a frequently encountered problem across a number of problem domains. Comparing graphs requires a metric to discriminate which features of the graphs are considered important. The spectrum of a graph is often claimed to contain all the information within a graph, but the raw spectrum contains too much information to be directly used as a useful metric. In this paper we introduce a metric, the weighted spectral distribution, that improves on the raw spectrum by discounting those eigen-values believed to be unimportant and emphasizing the contribution of those believed to be important.

Bio: 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 forecasting from Dublin City university in 2003. From 2003 to 2007 Damien lectured in the mathematics department at the National University of Ireland, Galway. In October 2007 he joined the NetOS group at the Computer Laboratory, Cambridge as a research associate with Andrew Moore. His current interests are quite varied ranging from time series analysis for engineering and financial applications to graph theory applied to computer networks.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity