#### Filter Results:

#### Publication Year

2000

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Diversity is an important characterization aspect for online social networks that usually denotes the homogeneity of a network's content and structure. This paper addresses the fundamental question of diversity evolution in large-scale online communities over time. In doing so, we study different established notions of network diversity, based on paths in… (More)

Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant to the study of Internet topologies, such as the generation of synthetic topologies to represent the Internet's AS topology. We derive a new metric that enables exactly such a structural… (More)

- Hamed Haddadi, Damien Fay, Almerima Jamakovic, Olaf Maennel, Andrew W. Moore, Richard Mortier +2 others
- ArXiv
- 2008

Many models have been proposed to generate Internet Autonomous System (AS) topologies, most of which make structural assumptions about the AS graph. In this paper we compare AS topology generation models with several observed AS topologies. In contrast to most previous works, we avoid making assumptions about which topological properties are important to… (More)

Short term electricity load forecasting is nowadays, of paramount importance in order to estimate next day electricity load resulting in energy save and environment protection. Electricity demand is influenced (among other things) by the day of the week, the time of year and special periods and/or days such as Ramadhan, all of which must be identified prior… (More)

- Hamed Haddadi, Andrew J. King, Alison P. Wills, Damien Fay, John Lowe, Jennifer Morton +2 others
- 2011

Social Network Analysis has become an important methodological tool for advancing our understanding of human and animal group behaviour. However, researchers tend to rely on arbitrary distance and time measures when defining 'contacts' or 'associations' between individuals based on preliminary observation. Otherwise, criteria are chosen on the basis of the… (More)

We introduce and study the spectral evolution model, which characterizes the growth of large networks in terms of the eigenvalue decomposition of their adjacency matrices: In large networks, changes over time result in a change of a graph's spectrum, leaving the eigenvectors unchanged. We validate this hypothesis for several large social, collaboration,… (More)

- Hamed Haddadi, Damien Fay, Steve Uhlig, Andrew W. Moore, Richard Mortier, Almerima Jamakovic +1 other
- SIPEW
- 2008

An increasing number of synthetic topology generators are available, each claiming to produce representative Internet topologies. Every generator has its own parameters, allowing the user to generate topologies with different characteristics. However, there exist no clear guidelines on tuning the value of these parameters in order to obtain a topology with… (More)

In this paper we study the structural evolution of the AS topology as inferred from two different datasets over a period of seven years. We use a variety of topological metrics to analyze the structural differences revealed in the AS topologies inferred from the two different datasets. In particular, to focus on the evolution of the relationship between the… (More)

- Damien Fay
- ArXiv
- 2015

In this paper we show how graph structure can be used to drastically reduce the computational bottleneck of the Breadth First Search algorithm (the foundation of many graph traversal techniques). In particular, we address parallel implementations where the bottleneck is the number of messages between processors emitted at the peak iteration. First, we… (More)