The Flow of Information in Networks

The information we experience online comes to us continuously over time, assembled from many small pieces, and conveyed through our social networks. This merging of information, network structure, and flow over time requires new ways of reasoning about the large-scale behavior of information networks. I'll discuss approaches for tracking information as it travels and mutates in online networks, showing how to capture temporal patterns in the news over a daily time-scale --in particular, the succession of story lines that evolve, compete for attention, and collectively produce an effect that commentators refer to as the news cycle. I'll also discuss how to quantify the influence of individual media sites on the popularity of stories and an algorithm for efficiently finding influential media sites. This talk includes joint work with Lars Backstrom, Jon Kleinberg and JaewonYang.
Jure Leskovec is assistant professor of Computer Science at Stanford University where he is a member of the Info Lab and the AI Lab. He joined the department in September 2009. He also collaborates with the Department of Knowledge Technologies, JozefStefan Institute, Ljubljana, Slovenia. In 2008/09 Jure was a postdoctoral researcher at Cornell University working with Jon Kleinberg and Dan Huttenlocher. He completed his Ph.D. in Machine Learning Department, School of Computer Science at Carnegie Mellon University under the supervision of Christos Faloutsos in September 2008. Leskovec has authored the Stanford Network Analysis Package (SNAP), a general purpose network analysis and graph mining library, that easily scales to massive networks with hundreds of millions of nodes, and billions of edges and efficiently manipulates large graphs, calculates structural properties, generates regular and random graphs, and supports attributes on nodes and edges.
Monday, 05/17/10
Contact:
Phone: 650-723-1616
Website: Click to Visit
Cost:
FreeSave this Event:
iCalendarGoogle Calendar
Yahoo! Calendar
Windows Live Calendar
