Sciweavers

Share
KDD
2008
ACM

Weighted graphs and disconnected components: patterns and a generator

9 years 2 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numerous, real, weighted graphs, and report surprising discoveries on the way in which new nodes join and form links in a social network. The motivating questions were the following: How do connected components in a graph form and change over time? What happens after new nodes join a network? how common are repeated edges? We study numerous diverse, real graphs (citation networks, networks in social media, internet traffic, and others); and make the following contributions: (a) we observe that the non-giant connected components seem to stabilize in size, (b) we observe the weights on the edges follow several power laws with surprising exponents, and (c) we propose an intuitive, generative model for graph growth that obeys observed patterns. Categories and Subject Descriptors: I.6.4 [Computing Methodologies]: Simul...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
Added 30 Nov 2009
Updated 30 Nov 2009
Type Conference
Year 2008
Where KDD
Authors Mary McGlohon, Leman Akoglu, Christos Faloutsos
Comments (0)
books