Network Graph Chuck Alice Vertices Nodes Edges Links Bob.

Slides:



Advertisements
Similar presentations
CSE 211 Discrete Mathematics
Advertisements

Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Connectivity Lecture _13.
Complex Networks Luis Miguel Varela COST meeting, Lisbon March 27 th 2013.
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Analysis and Modeling of Social Networks Foudalis Ilias.
Graph Traversals Visit vertices of a graph G to determine some property: Is G connected? Is there a path from vertex a to vertex b? Does G have a cycle?
Graph Theory. What is Graph Theory? This is the study of structures called ‘graphs’. These graphs are simply a collection of points called ‘vertices’
Advanced Topics in Data Mining Special focus: Social Networks.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Graph. Undirected Graph Directed Graph Simple Graph.
CS 728 Lecture 4 It’s a Small World on the Web. Small World Networks It is a ‘small world’ after all –Billions of people on Earth, yet every pair separated.
Applications of Depth-First Search
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
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.
Degree A F H G B E D C. Adjacent A F H G B E D C.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Social Media Mining Graph Essentials.
Social Networks Corina Ciubuc.
WEB SCIENCE: ANALYZING THE WEB. Graph Terminology Graph ~ a structure of nodes/vertices connected by edges The edges may be directed or undirected Distance.
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
Principles of Social Network Analysis. Definition of Social Networks “A social network is a set of actors that may have relationships with one another”
CompSci Today’s topics Networks ä Definitions ä Modeling ä Analysis ä Slides from Michael Kearns - Univ. of Pennsylvania ä Slides from Patrick.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
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.
Apollo 13 Characters. Jim Lovell – Tom Hanks Commander of Apollo 13 mission Retiring after this mission Voice of Woody in Toy Story films and Forrest.
Science: Graph theory and networks Dr Andy Evans.
Vertices and Edges Introduction to Graphs and Networks Mills College Spring 2012.
Professor Yashar Ganjali Department of Computer Science University of Toronto
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.
Topics Paths and Circuits (11.2) A B C D E F G.
Graphs and 2-Way Bounding Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 /File:7_bridgesID.png.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.
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.
MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
Social network analysis
Small World Social Networks With slides from Jon Kleinberg, David Liben-Nowell, and Daniel Bilar.
CompSci 100e 10.1 Is there a Science of Networks? l What kinds of networks are there? l From Bacon numbers to random graphs to Internet  From FOAF to.
Informatics tools in network science
Graph Concepts and Algorithms Using LEDA By Caroline Moore and Carmen Frerichs (252a-at and 252a-ao) each graph in the presentation was created using gw_basic_graph_algorithms.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Teachers Teaching With Technology 2010 Annual Meeting - Atlanta, GA Ray Barton, Olympus High, SLC, UT.
Trees.
Data Structures and Algorithms
Social Networks Analysis
Principles of Network Analysis
Network analysis.
Network Science: A Short Introduction i3 Workshop
Graph Algorithm.
Information propagation in social networks
Genome Assembly.
Why Social Graphs Are Different Communities Finding Triangles
Graph Operations And Representation
Connectivity Section 10.4.
Apollo 13 (1995) Produced by: Brian Grazer Directed by: Ron Howard
CS224w: Social and Information Network Analysis
Lecture 9: Network models CS 765: Complex Networks
Graphs G = (V, E) V are the vertices; E are the edges.
Practical Applications Using igraph in R Roger Stanton
Discrete Mathematics and Its Applications (5th Edition)
Warm Up – Tuesday Find the critical times for each vertex.
Chapter 10 Graphs and Trees
Discrete Mathematics and Its Applications (5th Edition)
Advanced Topics in Data Mining Special focus: Social Networks
Graphs G = (V,E) V is the vertex set.
Presentation transcript:

Network Graph Chuck Alice Vertices Nodes Edges Links Bob

Chuck Alice Bob

Chuck Alice Bob

Apollo 13 Network Tom Hanks Bill Paxton The Green Mile Kevin Bacon Magnificent Desolation: Walking on the Moon The Green Mile Bill Paxton Kevin Bacon Beyond All Boundaries Demi Moore Gary Sinise The Human Stain Ed Harris

Apollo 13 Network Tom Hanks Bill Paxton Kevin Bacon Gary Sinise Ed Directed or Undirected? Gary Sinise Ed Harris

Apollo 13 Network Degrees Tom Hanks Bill Paxton Gary Sinise Kevin Bacon Ed Harris Bill Paxton Gary Sinise Degrees Tom Hanks Bill Paxton Gary Sinise Kevin Bacon Ed Harris 2 2 4 1 1

3 2 3 2 4 4 3 3

Apollo 13 Network Edges: 5 Total Possible Edges: 10 Density: 5/10 = 0.5 Tom Hanks Bill Paxton Kevin Bacon Gary Sinise Ed Harris

Nodes: 8 Edges: 12 Total Possible Edges: ?? # Nodes * (# Nodes -1) 2 (8*7)/2 = 56/2 = 28 Density: 12/28 = 0.43

A E D C F G Path Distance / path length Shortest path SIX cliques H B

Apollo 13 Network Tom Hanks Bill Paxton Kevin Bacon Gary Sinise Ed Find cliques Gary Sinise Ed Harris

B C A J I H K R G D Q L M F N P E O

J I H G K R L N Q A M F P E D O C B

P 1 J I O 1 H G Q 2 C 2 R D 3 R 1 Q G 2 F P J 2 I 2 D O H 2 =18/10 1.8 C

P 2 J I O 2 H G Q 3 C 3 R D 4 F 1 Q G 1 F P J 1 I 1 D O H 1 =18/10 1.8 C

F 1 J I O 1 H G Q 1 C 2 R D 2 R 2 Q G 3 F P J 3 I 3 D O H 3 =21/10 2.1 Hub - connects many people (like R) D O H 3 =21/10 2.1 C

J I H G K R L N Q A M F P E D O C B Hub - connects many nodes, like R Bridge - if you delete a bridge, the endpoints will lie in different components D O C B

Q A P E D O Subnetwork C B

Q A E D Egocentric network for D, diameter 1 C B

Q A E D Egocentric network for D diameter 1.5 (All of D’s friends and the connections between them) C B

111 Edges, 48 nodes 111/(48*47) = 0.05