Slides - SNAP - Stanford University

More documents

Recommendations

Info

Example where this representation gives us computational leverage: Given a directed graph G Find the smallest set of nodes A so that every node in G is reachable from at least one node in AA. 9/20/2010 Jure Leskovec, <strong>Stanford</strong> CS224W: Social and Information Network Analysis 40
Take a large snapshot of the web and try to understand how it’s SCCs “fit” as a DAG. DAG Computational issue: Say want to find SCC containing containing node v? Observation: Out(v) … nodes that can be reached from v SCC containing v is is: 9/20/2010 Jure Leskovec, <strong>Stanford</strong> CS224W: Social and Information Network Analysis 41
Page 1 and 2: CS224W: Social and Information Netw
Page 3 and 4: How do we reason about networks Em
Page 5 and 6: Introduce properties, properties mo
Page 7 and 8: Information networks: World Wide W
Page 9 and 10: Mining social networks has a long h
Page 11 and 12: Network data spans many orders of m
Page 13 and 14: What have we learned about large ne
Page 15 and 16: One of the networks is a spread of
Page 17 and 18: Marketing and advertising: How to
Page 19 and 20: Covers a wide range of network anal
Page 21 and 22: Sonali Aggarwal Office Hours: Thur
Page 23 and 24: Assignment/Work g / Out on Due on R
Page 25 and 26: We will have 2 groups of 2‐3 2 3
Page 27 and 28: Google group: Main channel for ann
Page 29 and 30: Networks are becoming ubiquitous in
Page 31 and 32: 9/20/2010 Jure Leskovec, Stanford C
Page 33 and 34: 9/20/2010 Jure Leskovec, Stanford C
Page 35 and 36: How is the Web linked? What is the
Page 37 and 38: Two types of directed graphs: DAG
Page 39: Fact: Every y directed ggraph p is
Page 43 and 44: [Broder et al., ‘00] 250 million

Slides - SNAP - Stanford University

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?