Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS224w: Social and Information Network Analysis

Published byLiana Widjaja Modified over 5 years ago

Similar presentations

Presentation on theme: "CS224w: Social and Information Network Analysis"— Presentation transcript:

1 CS224w: Social and Information Network Analysis
Jure Leskovec, Stanford University

2 Structure of Networks? Network is a collection of objects where some pairs of objects are connected by links What is the structure of the network? 2/24/2019 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis,

3 Connectivity of Directed Graphs
Strongly connected directed graph has a path from each node to every other node and vice versa (e.g., A-B path and B-A path) Weakly connected directed graph is connected if we disregard the edge directions E F B A Graph on the left is not strongly connected. D C G

Download ppt "CS224w: Social and Information Network Analysis"

Similar presentations

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Connectivity Lecture _13.

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Connectivity Lecture _13.
Analysis of Algorithms CS 477/677

Analysis of Algorithms CS 477/677
Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.

Network Optimization Problems: Models and Algorithms This handout: Minimum Spanning Tree Problem.
Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.

Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.
CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.

CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
New Algorithm DOM for Graph Coloring by Domination Covering

New Algorithm DOM for Graph Coloring by Domination Covering
D1: Matchings.

D1: Matchings.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.

Chapter 11 Graphs and Trees This handout: Terminology of Graphs Eulerian Cycles.
Balanced Binary Search Trees height is O(log n), where n is the number of elements in the tree AVL (Adelson-Velsky and Landis) trees red-black trees get,

Balanced Binary Search Trees height is O(log n), where n is the number of elements in the tree AVL (Adelson-Velsky and Landis) trees red-black trees get,
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.

Introduction to Graphs. Introduction Graphs are a generalization of trees –Nodes or verticies –Edges or arcs Two kinds of graphs –Directed –Undirected.
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.

1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
Network topology, cut-set and loop equation

Network topology, cut-set and loop equation
Network Lasso: Clustering and Optimization in Large Graphs

Network Lasso: Clustering and Optimization in Large Graphs
Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.

Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.
+ Big Data, Network Analysis Week 13. + How is date being used Predict Presidential Election - Nate Silver –

+ Big Data, Network Analysis Week How is date being used Predict Presidential Election - Nate Silver –
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.

Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
Networks are connections and interactions. Networks are present in every aspect of life. Examples include economics/social/political sciences. Networks.

Networks are connections and interactions. Networks are present in every aspect of life. Examples include economics/social/political sciences. Networks.

Similar presentations

Ads by Google