1 / 63

CS8803-NS Network Science Fall 2013

CS8803-NS Network Science Fall 2013. Instructor: Constantine Dovrolis constantine@gatech.edu http://www.cc.gatech.edu/~dovrolis/Courses/NetSci/. Disclaimers.

tejano
Download Presentation

CS8803-NS Network Science Fall 2013

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. CS8803-NSNetwork ScienceFall 2013 Instructor: Constantine Dovrolis constantine@gatech.edu http://www.cc.gatech.edu/~dovrolis/Courses/NetSci/

  2. Disclaimers The following slides include only the figures or videos that we use in class; they do not include detailed the explanations, derivations or descriptionscovered in class. Many of the following figures are copied from open sources at the Web. I do not claim any intellectual property for the following material.

  3. Outline • Basic concepts • Graphs, paths, adjacency matrix, etc • Centrality metrics • Clustering metrics • Cliques and cores • Assortativity metrics • Weighted networks • Application paper: airline networks • Spatial networks • Application paper: city networks • More about betweenness centrality • Betweenness centrality algorithm by Brandes • Mini-talk by Oded Green about parallel/streaming BC computation • Surprise “visitor” will talk about Network Medicine

  4. Undirected, directed, weighted graphs

  5. Graph adjacency matrix http://sourcecodemania.com/wp-content/uploads/2012/06/adjacency-matrix-of-graph.jpg

  6. Graph adjacency matrix (cont’) • Many network properties can be formulated as properties of the adjacency matrix • See “algebraic graph theory” • For instance: • A directed network is acyclic if and only if all eigenvalues of the adjacency matrix are equal to 0 • Proof?

  7. Planar graphs • Here is an example of a famous graph theory result: • Kuratowski: Every non-planar graph contains at least one subgraph that is an expansion of a 5-node clique or of the “utility graph” K3,3 (shown at the top right) http://people.hofstra.edu/geotrans/eng/methods/img/planarnonplanar.png

  8. Node degree, in-out degrees, degree distribution k’th moment • Directed graphs: aij=1 if edge from i to j

  9. Degree distribution http://1.bp.blogspot.com/-QJTJS8wcdtg/T5rio1NHPvI/AAAAAAAAAq8/umNpggK8VAY/s400/p1.png

  10. Average degree, connectance, sparse and dense graphs • Undirected graph with n nodes and m edges • Average node degree: c = 2*m / n • Connectance: ρ = c / (n-1) • What happens to ρ as n tends to infinity? • Sparse graphs: ρ tends to zero • Dense graphs: ρ tends to positive constant

  11. Paths, Shortest Paths, Diameter, Characteristic Path Length, Graph Efficiency

  12. Paths and their length a b d • Number of paths of length r from j to i: Nij(r)=[Ar]ij c http://www.math.cornell.edu/~mec/Winter2009/RalucaRemus/Lecture2/Images/A2.gif

  13. Cyclic and Acyclic graphs • Number of loops of length r anywhere in network: L(r) = Σi[Ar] ii = Tr[Ar]= Σi[kir] • kieigenvalue of adjacency matrix • Proof? Easier for undirected networks http://upload.wikimedia.org/wikipedia/commons/thumb/3/39/Directed_acyclic_graph_3.svg/356px-Directed_acyclic_graph_3.svg.png

  14. Eulerian and Hamiltonian graphs http://www.transtutors.com/Uploadfile/CMS_Images/10131_Hamiltonian%20Graphs.JPG

  15. Weakly Connected Components & Strongly Connected Components http://media.tumblr.com/tumblr_m0oeu763ds1qir7tc.png

  16. Min-cut and max-flow http://scienceblogs.com/goodmath/wp-content/blogs.dir/476/files/2012/04/i-d36ecaca5a38da5705e2e708e6d84070-max-flow.png • For a given (source, sink) pair: the max flow between them is the sum of the weights of the edges of the min-cut-set that separates (source, sink)

  17. Network centrality metrics http://www-personal.umich.edu/~mejn/centrality/labeled.png

  18. http://www.isearchm.com/wp-content/uploads/2012/05/networks.jpghttp://www.isearchm.com/wp-content/uploads/2012/05/networks.jpg We will talk later about centrality metrics for directed networks, such as PageRank or HITS

  19. Cliques, plexes and cores • Clique of size n: maximal subset of nodes, with every node connected to every other member of the subset • k-plex of size n: maximal subset of nodes, with every node connected to at least n-k other members of the subset • k=1: clique • k>1: “approximate clique” • k-core of size n: maximal subset of nodes, with every node connected to at least k others in the subset

  20. K-core decomposition http://www.nature.com/srep/2012/120420/srep00371/images/srep00371-f1.jpg

  21. Transitivity & Clustering coeff

  22. Clustering coefficient http://www.emeraldinsight.com/fig/202_10_1108_S1479-361X_2012_0000010012.png

  23. Degree correlations In general, is knn(k) increasing/decreasing with k?

  24. Assortativity – Degree mixing http://stepsandleaps.files.wordpress.com/2013/08/assortative_disassortative.jpg?w=450&h=235 How would you classify social networks in this axis? Technological networks such as the Internet?

  25. Core-periphery networks (“rich club” network) http://km4meu.files.wordpress.com/2009/11/core-periphery-ross-mayfield1.jpg

  26. Outline • Basic concepts • Graphs, paths, adjacency matrix, etc • Centrality metrics • Clustering metrics • Cliques and cores • Assortativity metrics • Weighted networks • Application paper: airline networks • Spatial networks • Application paper: city networks • More about betweenness centrality • Betweenness centrality algorithm by Brandes • Mini-talk by Oded Green about parallel/streaming BC computation • Surprise “visitor” will talk about Network Medicine

  27. Node strength

  28. Strength distribution

  29. Relation between strength and degree

  30. Weighted clustering coefficient

  31. Weighted average neighbors degree

  32. Outline • Basic concepts • Graphs, paths, adjacency matrix, etc • Centrality metrics • Clustering metrics • Cliques and cores • Assortativity metrics • Weighted networks • Application paper: airline networks • Spatial networks • Application paper: city networks • More about betweenness centrality • Betweenness centrality algorithm by Brandes • Mini-talk by Oded Green about parallel/streaming BC computation • Surprise “visitor” will talk about Network Medicine

  33. Spatial networks • Nodes are embedded in physical space (2d or 3d) • Edges have physical length • Planar graphs constraint • Spatial embedding affects maximum degree or maximum edge length • Spatial networks vs Relational networks

  34. Analyzed one-square-mile maps from 18 cities

  35. Food for thought • How do you explain the (major) difference in the distributions of betweenness centrality and information centrality? • What is a good generative model for self-organized cities? • How would you cluster similar cities together based on their spatial network properties?

More Related