Slides - SNAP - Stanford University

More documents

Recommendations

Info

9/20/2010 Jure Leskovec, <strong>Stanford</strong> CS224W: Social and Information Network Analysis 36
Two types of directed graphs: DAG –directed acyclic graph: Has no cycles: if u can reach v, then v can not reach u Strongly connected: Any node can reach any node via a directed path Any directed graph can be expressed in terms of these two types 9/20/2010 Jure Leskovec, <strong>Stanford</strong> CS224W: Social and Information Network Analysis 37
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: How is the Web linked? What is the
Page 39 and 40: Fact: Every y directed ggraph p is
Page 41 and 42: Take a large snapshot of the web an
Page 43 and 44: [Broder et al., ‘00] 250 million

Slides - SNAP - Stanford University

Create successful ePaper yourself

Delete template?

Save as template?