ACM Home Page
Please provide us with feedback. Feedback
On the bursty evolution of blogspace
Full text PdfPdf (169 KB)
Source International World Wide Web Conference archive
Proceedings of the 12th international conference on World Wide Web table of contents
Budapest, Hungary
SESSION: Dynamic services and analysis table of contents
Pages: 568 - 576  
Year of Publication: 2003
ISBN:1-58113-680-3
Authors
Ravi Kumar  IBM Almaden Research Center, San Jose, CA
Jasmine Novak  IBM Almaden Research Center, San Jose, CA
Prabhakar Raghavan  Verity Inc., Sunnyvale, CA
Andrew Tomkins  IBM Almaden Research Center, San Jose, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 234,   Citation Count: 58
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775152.775233
What is a DOI?

ABSTRACT

We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing link creation as a point phenomenon in time. Second, we develop definitions and algorithms for time-dense community tracking, to crystallize the notion of community evolution. We develop these tools in the context of Blogspace , the space of weblogs (or blogs). Our study involves approximately 750K links among 25K blogs. We create a time graph on these blogs by an automatic analysis of their internal time stamps. We then study the evolution of connected component structure and microscopic community structure in this time graph. We show that Blogspace underwent a transition behavior around the end of 2001, and has been rapidly expanding over the past year, not just in metrics of scale, but also in metrics of community structure and connectedness. This expansion shows no sign of abating, although measures of connectedness must plateau within two years. By randomizing link destinations in Blogspace, but retaining sources and timestamps, we introduce a concept of randomized Blogspace . Herein, we observe similar evolution of a giant component, but no corresponding increase in community structure. Having demonstrated the formation of micro-communities over time, we then turn to the ongoing activity within active communities. We extend recent work of Kleinberg [11] to discover dense periods of "bursty" intra-community link creation.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
 
5
D. Eppstein, Z. Galil, and G. Italiano. Dynamic graph algorithms. In CRC Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, 1997.
 
6
P. Erdös and A. Rényi. On the evolution of random graphs. Magy. Tud. Akad. Mat. Kut. Intez. Kozl., 5:17--61, 1960.
 
7
U. Feige, D. Peleg, and G. Kortsarz. The dense k-subgraph problem. Algorithmica, 29(3):410--421, 2001.
 
8
D. Fetterly, M. Manasse, M. Najork, and J. Wiener. Crawling towards light: A large scale study of the evolution of web pages. In Proc. 1st Workshop on Algorithms for the Web, 2002.
9
10
11
 
12
 
13
 
14
 
15
The Internet Archive http://www.archive.org.

CITED BY  58

Collaborative Colleagues:
Ravi Kumar: colleagues
Jasmine Novak: colleagues
Prabhakar Raghavan: colleagues
Andrew Tomkins: colleagues