Social Network Analysis Lecture 2-Introduction Graph Theory

Social Network Analysis Lecture 2-Introduction Graph Theory

Social Network Analysis Lecture 2-Introduction Graph Theory Donglei Du ([email protected]) Faculty of Business Administration, University of New Brunswick, NB Canada Fredericton E3B 9Y2 Donglei Du (UNB) Social Network Analysis 1 / 1 Table of contents Donglei Du (UNB) Social Network Analysis 2 / 1 Layout Donglei Du (UNB) Social Network Analysis 3 / 1 Graph theory is the study of graphs, which are mathematical representation of a network used to model pairwise relations between objects. A graph consists of a set of "vertices" or "nodes", with certain pairs of these nodes connected by "edges" (undirected) or "arcs" (directed). A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or directed, meaning that its arcs may be directed from one vertex to another. This is an extremely brief introduction of graph theory. What is Graph theory? Donglei Du (UNB) Social Network Analysis 4 / 1 A graph consists of a set of "vertices" or "nodes", with certain pairs of these nodes connected by "edges" (undirected) or "arcs" (directed). A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or directed, meaning that its arcs may be directed from one vertex to another. This is an extremely brief introduction of graph theory. What is Graph theory? Graph theory is the study of graphs, which are mathematical representation of a network used to model pairwise relations between objects. Donglei Du (UNB) Social Network Analysis 4 / 1 A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or directed, meaning that its arcs may be directed from one vertex to another. This is an extremely brief introduction of graph theory. What is Graph theory? Graph theory is the study of graphs, which are mathematical representation of a network used to model pairwise relations between objects. A graph consists of a set of "vertices" or "nodes", with certain pairs of these nodes connected by "edges" (undirected) or "arcs" (directed). Donglei Du (UNB) Social Network Analysis 4 / 1 This is an extremely brief introduction of graph theory. What is Graph theory? Graph theory is the study of graphs, which are mathematical representation of a network used to model pairwise relations between objects. A graph consists of a set of "vertices" or "nodes", with certain pairs of these nodes connected by "edges" (undirected) or "arcs" (directed). A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or directed, meaning that its arcs may be directed from one vertex to another. Donglei Du (UNB) Social Network Analysis 4 / 1 What is Graph theory? Graph theory is the study of graphs, which are mathematical representation of a network used to model pairwise relations between objects. A graph consists of a set of "vertices" or "nodes", with certain pairs of these nodes connected by "edges" (undirected) or "arcs" (directed). A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or directed, meaning that its arcs may be directed from one vertex to another. This is an extremely brief introduction of graph theory. Donglei Du (UNB) Social Network Analysis 4 / 1 Q: Is there a Eulerian trail through the city that would cross each bridge once and only once? (The second (undirected) graph represents the bridge network!) A: an (connected) undirected graph has an Eulerian trail if and only if at most two vertices have odd degree. Leonhard Euler (15 April 1707-18 September 1783, Swiss Mathematician) in 1735 laid the foundations of graph theory and prefigured the idea of topology by studying this problem. The Seven Bridges of K¨onigsberg: Donglei Du (UNB) Social Network Analysis 5 / 1 Leonhard Euler (15 April 1707-18 September 1783, Swiss Mathematician) in 1735 laid the foundations of graph theory and prefigured the idea of topology by studying this problem. The Seven Bridges of K¨onigsberg: Q: Is there a Eulerian trail through the city that would cross each bridge once and only once? (The second (undirected) graph represents the bridge network!) A: an (connected) undirected graph has an Eulerian trail if and only if at most two vertices have odd degree. Donglei Du (UNB) Social Network Analysis 5 / 1 The Seven Bridges of K¨onigsberg: Q: Is there a Eulerian trail through the city that would cross each bridge once and only once? (The second (undirected) graph represents the bridge network!) A: an (connected) undirected graph has an Eulerian trail if and only if at most two vertices have odd degree. Leonhard Euler (15 April 1707-18 September 1783, Swiss Mathematician) in 1735 laid the foundations of graph theory and prefigured the idea of topology by studying this problem. Donglei Du (UNB) Social Network Analysis 5 / 1 Paul Erd¨os(26 March 191320 September 1996, Hungarian mathematician): one of the most prolific publishers of papers in mathematical history, comparable only with Leonhard Euler; Erd¨ospublished more papers, mostly in collaboration with other mathematicians, while Euler published more pages, mostly by himself. The Erd¨oscoauthor network and Erd¨osnumber: Donglei Du (UNB) Social Network Analysis 6 / 1 The Erd¨oscoauthor network and Erd¨osnumber: Paul Erd¨os(26 March 191320 September 1996, Hungarian mathematician): one of the most prolific publishers of papers in mathematical history, comparable only with Leonhard Euler; Erd¨ospublished more papers, mostly in collaboration with other mathematicians, while Euler published more pages, mostly by himself. Donglei Du (UNB) Social Network Analysis 6 / 1 Paul Erd¨os(0) and Prasad Tetali (1), Representations of integers as the sum of k terms, Random Structures Algorithms, 1(3) (1990), 245-261. Prasad Tetali (1), Juan C. Vera (2), Eric Vigoda, and Linji Yang, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, Annals of Applied Probability, 22(6) (2012), 2210-2239. Qiaming Han, Donglei Du (3), Juan C. Vera (2) and Luis F. Zuluag, Improved bounds for the symmetric rendezvous search problem on the line, Operations Research, 56(3) (2008), 772-782. Find your own Erd¨osNumber here: http://www.ams.org/mathscinet/collaborationDistance.html If you want to know more about Erd¨osNumber,try here: http://www.oakland.edu/enp/compute/ My Erd¨osNumber: 3 Donglei Du (UNB) Social Network Analysis 7 / 1 Prasad Tetali (1), Juan C. Vera (2), Eric Vigoda, and Linji Yang, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, Annals of Applied Probability, 22(6) (2012), 2210-2239. Qiaming Han, Donglei Du (3), Juan C. Vera (2) and Luis F. Zuluag, Improved bounds for the symmetric rendezvous search problem on the line, Operations Research, 56(3) (2008), 772-782. Find your own Erd¨osNumber here: http://www.ams.org/mathscinet/collaborationDistance.html If you want to know more about Erd¨osNumber,try here: http://www.oakland.edu/enp/compute/ My Erd¨osNumber: 3 Paul Erd¨os(0) and Prasad Tetali (1), Representations of integers as the sum of k terms, Random Structures Algorithms, 1(3) (1990), 245-261. Donglei Du (UNB) Social Network Analysis 7 / 1 Qiaming Han, Donglei Du (3), Juan C. Vera (2) and Luis F. Zuluag, Improved bounds for the symmetric rendezvous search problem on the line, Operations Research, 56(3) (2008), 772-782. Find your own Erd¨osNumber here: http://www.ams.org/mathscinet/collaborationDistance.html If you want to know more about Erd¨osNumber,try here: http://www.oakland.edu/enp/compute/ My Erd¨osNumber: 3 Paul Erd¨os(0) and Prasad Tetali (1), Representations of integers as the sum of k terms, Random Structures Algorithms, 1(3) (1990), 245-261. Prasad Tetali (1), Juan C. Vera (2), Eric Vigoda, and Linji Yang, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, Annals of Applied Probability, 22(6) (2012), 2210-2239. Donglei Du (UNB) Social Network Analysis 7 / 1 Find your own Erd¨osNumber here: http://www.ams.org/mathscinet/collaborationDistance.html If you want to know more about Erd¨osNumber,try here: http://www.oakland.edu/enp/compute/ My Erd¨osNumber: 3 Paul Erd¨os(0) and Prasad Tetali (1), Representations of integers as the sum of k terms, Random Structures Algorithms, 1(3) (1990), 245-261. Prasad Tetali (1), Juan C. Vera (2), Eric Vigoda, and Linji Yang, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, Annals of Applied Probability, 22(6) (2012), 2210-2239. Qiaming Han, Donglei Du (3), Juan C. Vera (2) and Luis F. Zuluag, Improved bounds for the symmetric rendezvous search problem on the line, Operations Research, 56(3) (2008), 772-782. Donglei Du (UNB) Social Network Analysis 7 / 1 here: http://www.ams.org/mathscinet/collaborationDistance.html If you want to know more about Erd¨osNumber,try here: http://www.oakland.edu/enp/compute/ My Erd¨osNumber: 3 Paul Erd¨os(0) and Prasad Tetali (1), Representations of integers as the sum of k terms, Random Structures Algorithms, 1(3) (1990), 245-261. Prasad Tetali (1), Juan C. Vera (2), Eric Vigoda, and Linji Yang, Phase transition for the mixing time of the Glauber dynamics for coloring regular trees, Annals of Applied Probability, 22(6) (2012), 2210-2239. Qiaming Han, Donglei Du (3), Juan C. Vera (2) and Luis F. Zuluag, Improved bounds for the symmetric rendezvous search problem on the line, Operations Research, 56(3) (2008), 772-782. Find your own Erd¨osNumber Donglei Du (UNB) Social Network Analysis 7 / 1 If you want to know more about Erd¨osNumber,try here: http://www.oakland.edu/enp/compute/ My Erd¨osNumber: 3 Paul Erd¨os(0) and Prasad Tetali (1), Representations of integers as the sum of k terms, Random Structures Algorithms, 1(3) (1990), 245-261.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    116 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us