DOCSLIB.ORG

Network Analysis / Visualization Announcements

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Network Analysis / Visualization Maneesh Agrawala Jessica Hullman CS 294-10: Visualization Fall 2014 Announcements 1 Final project Design new visualization method ■ Pose problem, Implement creative solution Deliverables ■ Implementation of solution ■ 8-12 page paper in format of conference paper submission ■ 1 or 2 design discussion presentations Schedule ■ Project proposal: 10/27 ■ Project presentation: 11/10, 11/12 ■ Final paper and presentation: TBD, likely 12/1-12/5 Grading ■ Groups of up to 3 people, graded individually ■ Clearly report responsibilities of each member Network Analysis & Visualization *Many slides adapted from E. Adar’s / L. Adamic’s Network Theory and Applications course slides. 2 Basic definition Networks (graphs) are collections of points joined by lines Edges can be directed / undirected Edges and nodes can have attributes associated with them 1 2 node 3 edge 4 Adjacency matrix 5 1 2 3 4 5 1 0 0 1 0 0 points lines 2 0 0 1 0 0 vertices edges, arcs 3 1 1 0 1 1 nodes links 4 0 0 1 0 1 actors ties, relations 5 0 0 1 1 0 Diseases http://diseasome.eu/ 3 Transportation http://www.lx97.com/maps/ Online social networks Friendster Heer, J., and boyd, d. Vizster: Visualizing Online Social Networks. InfoVis 2005. 4 Lombardi, M. ‘George W. Bush, Harken Energy and Jackson Stephens, ca 1979–90’ Actors and movies (bipartite) 5 Applications Tournaments Organization Charts Genealogy Text Biological Interactions (Genes, Proteins) Computer Networks Social Networks Simulation and Modeling Integrated Circuit Design 6 Characterizing networks What does it look like? Size? Density? Centralization? Clustering? Components? Cliques? Motifs? Avg. path length? … www.opte.org 7 Topics Network Analysis • Centrality / centralization • Community structure • Pattern identification • Models Tools for Network EDA Centrality 8 How far apart are things? Distance: shortest paths Shortest path (geodesic path) ■ The shortest sequence of links connecting two B nodes A ■ Not always unique C n A and C are connected by 2 shortest paths n A – E – B - C D E n A – E – D - C 9 Distance: shortest paths Shortest path from 2 to 3: 1 4 6 2 1 5 7 3 Diameter? Distance: shortest paths Shortest path from 2 to 3? Shortest path from each pair? 4 6 2 1 5 7 3 10 Most important node? Centrality Y Y X X outdegree indegree Y X X Y betweenness closeness 11 Degree centrality (undirected) C d(n ) A A D = i = i+ = ∑ ij j Normalized degree centrality d(i) CD (i) = N−1 12 When is degree not sufficient? ability to broker between groups likelihood that information originating anywhere in the network reaches you Betweenness Assuming nodes communicate using the most direct route, how many pairs of nodes have to pass information through target node? Y X Y Y X X 13 Betweenness: definition CB (i) = ∑ gjk (i) / gjk j,k≠i, j<k gjk = the number of geodesics connecting jk gjk(i) = the number that actor i is on. Normalization: ' CB (i) = CB (i )/[(n −1)(n − 2)/2] number of pairs of vertices excluding the vertex itself € Betweenness - examples non-normalized: A B C D E 14 Lada’s facebook network: nodes are sized by degree, and colored by betweenness (blue- >red è low->high). When are Cd, Cb not sufficient? likelihood that information originating anywhere in the network reaches you 15 Closeness: definition Being close to the center of the graph Closeness Centrality: −1 # N & Cc (i) = % ∑ d(i, j)( $% j=1, j≠i '( Normalized Closeness Centrality ' N −1 CC (i) = (CC (i)) / (N −1) = N ∑ d(i, j) j=1, j≠i Examples - closeness 16 Centrality in directed networks Prestige degree centrality ~ indegree centrality closeness ~ consider nodes from which target node can be reached influence range ~ nodes reachable from target node betweenness ~ consider directed shortest paths Straight-forward modifications to equations for non-directed graphs Characterizing• generally different centrality metrics will be posively correlated nodes • when they are not, there is likely something interesJng about the network • suggest possible topologies and node posions to fit each square Low Low Low Degree Closeness Betweenness High Degree Node embedded in Node's connections cluster that is far are redundant - from the rest of the communication network bypasses him/her High Closeness Node links to a Many paths likely to small number of be in network; node important/active is near many other nodes. people, but so are many others High Node’s few ties are Rare. Node Betweenness crucial for network monopolizes the ties flow from a small number of people to many others. 17 Centralization – how equal Variation in the centrality scores among the nodes Freeman’s general formula for centralization: maximum value in the network g * ∑ [CD (n ) − CD (i)] C = i=1 D [(N −1)(N − 2)] € Examples g * [CD (n ) − CD (ni )] C = ∑i=1 D [(N −1)(N − 2)] (5− 5)+ (5−1)× 5 C = =1 D (6 −1)(6 − 2) 18 Examples CD = 0.167 CD = 1.0 CD = 0.167 Financial networks 19 Baker and Faulkner Price fixing scams in switchgear, transformer, and turbine industries What network relaons facilitate illegal behavior/ conspiracy? The Social Organization of Conspiracy: Illegal Networks in the Heavy Electrical Equipment Industry, Wayne E. Baker, Robert R. Faulkner. American Sociological Review, Vol. 58, No. 6 (Dec., 1993), pp. 837-860. Theoretical predictions 20 Results Low information-processing conspiracies are decentralized, high information processing load leads to centralization. At the individual level, degree centrality predicts verdict. Community Structure 21 How dense is it? Max. possible edges: density = e/ emax ■ Directed: emax = n*(n-1) ■ Undirected: emax = n*(n-1)/2 Is everything connected? 22 Connected components - directed Strongly connected components ■ Each node in component can be reached from every other node in component by following directed links F n B C D E B G n A A C H n G H D n F E Weakly connected components ■ Each node can be reached from every other node by following links in either direction n A B C D E n G H F Broder et al. (1999) 23 Finding connected components 1 Digby’s Blog 21 JawaReport 2 James Walcott 11 21 22 Vodka Pundit 3 Pandagon 1 22 21 23 Roger L Simon 4 blog.johnkerry.com 33 24 Tim Blair 5 Oliver Willis 23 25 Andrew Sullivan 6 America Blog 4 2222 23 4 5 24 26 Instapundit 7 Crooked Timber 66 5 24 2727 27 Blogs for Bush 8 Daily Kos 7 25 28 LittleGreenFootballs 7 25 26 9 American Prospect 8 26 2828 29 Belmont Club 10 Eschaton 1010 29 9 1111 29 3030 30 Captain’s Quarters 11 Wonkette 9 31 Powerline 12 Talk Left 13 1212 32 Hugh Hewitt 13 32 13 Political Wire 31 32 33 INDC journal 14 Talking Points Memo 17 31 17 1515 1414 34 Real Clear Politics 15 Matthew Yglesias 1818 33 35 Winds of Change 3535 33 16 Washington Monthly 1616 3434 35 363636 Allahpundit 17 MyDD 37 Michelle Malkin 18 Juan Cole 1919 39 38 Wizbang 3838 39 19 Left Coaster 3737 38 39 Dean’s World 20 Bradford DeLong 40 Volokh 20 20 4040 Adamic, L., and Glance, N. The political blogosphere and the 2004 US election: Divided they blog. Proceedings of the 3rd international workshop on Link discovery, p.36-43, (2005) Community finding 24 Hierarchical clustering Process: ■ Calculate weights W for all pairs of vertices ■ Start: N disconnected vertices ■ Adding edges (one by one) between pairs in order of decreasing weight ■ Result: nested components Hierarchical clustering 25 Hierarchical clustering Betweenness clustering Girvan and Newman 2002 iterative algorithm: ■ Compute Cb of all edges ■ Remove edge i where Cb(i) == max(Cb) ■ Recalculate betweenness 26 Clustering coefficient Local clustering coefficient: number of closed triplets centered on i C = i number of connected triplets centered on i i i i Global clustering coefficient: Ci = 1/3 = 0.33 3* number of closed triplets CG = number of connected triplets CG= 3*1/5 = 0.6 Comparing to random graph ■ clustering coefficient ■ compare to a randomized version (conserving node degree) ■ degree distribution ■ assortativity ■ do high degree nodes connect to other high degree nodes? ■ average shortest path ■ motif profile 27 Pattern finding - motifs Define / search for a particular structure, e.g. complete triads W X Y Z Motifs can overlap in the network graph motif to be found motif matches http://mavisto.ipk-gatersleben.de/frequency_concepts.html 28 4 node subgraphs Motif detection 29 Tools Network EDA Structure Useful features: • Centralizaon • Associate aributes • Density • Node/graph level centrality • Clustering, components • Filter on stas;cs • Mo;fs • Examine distribu;ons • Comparison to models • Iden;fy components, clusters • Define and search for paerns • Create random graphs, calculate AGributes stas;cs • Nodes / links / communi;es • Map stas;cs to visual features (color, size, weight) • Track nodes and groups of interest • Zoom and pan in large graphs 30 Pajek Mrvar, A. Pajek - Program for Large Network Analysis. Connections 21(1998)2, 47-57 GUESS Adar, E. GUESS: The Graph Exploration System. ACM CHI 2006. 31 GUESS: plotting statistics GUESS – convex hulls 32 SocialAction Challenge: User directedness + number of stas;cal features leads to opportunis;c analysis in most tools Soluon: ■ Provide overview ■ Use aribute ranking and coordinated views ■ Aggregate networks, iden;fy communi;es ■ View bi-, tripar;te (etc.) networks separately ■ Access to matrix overview ■ Keep nodes in place Perer, A. and Shneiderman, B. Balancing systematic and flexible exploration of social networks. InfoVis 2006. SocialAction 33 SocialAction SocialAction 34 Other tools Gephi Prefuse TouchGraph GraphViz NodeXL NetLogo Simulating network models 35 Small world network Milgram (1967) ■ Mean path length in US social networks ■ ~ 6 hops separate any two people Small world networks Watts and Strogatz 1998 ■ a few random links in an otherwise structured graph make the network a small world regular lattice: small world: random graph: my friend’s friend is mostly structured all connections always my friend with a few random random connections 36 Defining small world phenomenon Pattern: ■ high clustering C C ■ low mean shortest path network >> random graph lnetwork ≈ ln(N) Examples ■ neural network of C.
Recommended publications
  • Networkx: Network Analysis with Python

    Networkx: Network Analysis with Python

    NetworkX: Network Analysis with Python Salvatore Scellato Full tutorial presented at the XXX SunBelt Conference “NetworkX introduction: Hacking social networks using the Python programming language” by Aric Hagberg & Drew Conway Outline 1. Introduction to NetworkX 2. Getting started with Python and NetworkX 3. Basic network analysis 4. Writing your own code 5. You are ready for your project! 1. Introduction to NetworkX. Introduction to NetworkX - network analysis Vast amounts of network data are being generated and collected • Sociology: web pages, mobile phones, social networks • Technology: Internet routers, vehicular flows, power grids How can we analyze this networks? Introduction to NetworkX - Python awesomeness Introduction to NetworkX “Python package for the creation, manipulation and study of the structure, dynamics and functions of complex networks.” • Data structures for representing many types of networks, or graphs • Nodes can be any (hashable) Python object, edges can contain arbitrary data • Flexibility ideal for representing networks found in many different fields • Easy to install on multiple platforms • Online up-to-date documentation • First public release in April 2005 Introduction to NetworkX - design requirements • Tool to study the structure and dynamics of social, biological, and infrastructure networks • Ease-of-use and rapid development in a collaborative, multidisciplinary environment • Easy to learn, easy to teach • Open-source tool base that can easily grow in a multidisciplinary environment with non-expert users
  • A Network Approach of the Mandatory Influenza Vaccination Among Healthcare Workers

    A Network Approach of the Mandatory Influenza Vaccination Among Healthcare Workers

    Wright State University CORE Scholar Master of Public Health Program Student Publications Master of Public Health Program 2014 Best Practices: A Network Approach of the Mandatory Influenza Vaccination Among Healthcare Workers Greg Attenweiler Wright State University - Main Campus Angie Thomure Wright State University - Main Campus Follow this and additional works at: https://corescholar.libraries.wright.edu/mph Part of the Influenza Virus accinesV Commons Repository Citation Attenweiler, G., & Thomure, A. (2014). Best Practices: A Network Approach of the Mandatory Influenza Vaccination Among Healthcare Workers. Wright State University, Dayton, Ohio. This Master's Culminating Experience is brought to you for free and open access by the Master of Public Health Program at CORE Scholar. It has been accepted for inclusion in Master of Public Health Program Student Publications by an authorized administrator of CORE Scholar. For more information, please contact library- [email protected]. Running Head: A NETWORK APPROACH 1 Best Practices: A network approach of the mandatory influenza vaccination among healthcare workers Greg Attenweiler Angie Thomure Wright State University A NETWORK APPROACH 2 Acknowledgements We would like to thank Michele Battle-Fisher and Nikki Rogers for donating their time and resources to help us complete our Culminating Experience. We would also like to thank Michele Battle-Fisher for creating the simulation used in our Culmination Experience. Finally we would like to thank our family and friends for all of the
  • Introduction to Network Science & Visualisation

    Introduction to Network Science & Visualisation

    IFC – Bank Indonesia International Workshop and Seminar on “Big Data for Central Bank Policies / Building Pathways for Policy Making with Big Data” Bali, Indonesia, 23-26 July 2018 Introduction to network science & visualisation1 Kimmo Soramäki, Financial Network Analytics 1 This presentation was prepared for the meeting. The views expressed are those of the author and do not necessarily reflect the views of the BIS, the IFC or the central banks and other institutions represented at the meeting. FNA FNA Introduction to Network Science & Visualization I Dr. Kimmo Soramäki Founder & CEO, FNA www.fna.fi Agenda Network Science ● Introduction ● Key concepts Exposure Networks ● OTC Derivatives ● CCP Interconnectedness Correlation Networks ● Housing Bubble and Crisis ● US Presidential Election Network Science and Graphs Analytics Is already powering the best known AI applications Knowledge Social Product Economic Knowledge Payment Graph Graph Graph Graph Graph Graph Network Science and Graphs Analytics “Goldman Sachs takes a DIY approach to graph analytics” For enhanced compliance and fraud detection (www.TechTarget.com, Mar 2015). “PayPal relies on graph techniques to perform sophisticated fraud detection” Saving them more than $700 million and enabling them to perform predictive fraud analysis, according to the IDC (www.globalbankingandfinance.com, Jan 2016) "Network diagnostics .. may displace atomised metrics such as VaR” Regulators are increasing using network science for financial stability analysis. (Andy Haldane, Bank of England Executive
  • A Centrality Measure for Electrical Networks

    A Centrality Measure for Electrical Networks

    Carnegie Mellon Electricity Industry Center Working Paper CEIC-07 www.cmu.edu/electricity 1 A Centrality Measure for Electrical Networks Paul Hines and Seth Blumsack types of failures. Many classifications of network structures Abstract—We derive a measure of “electrical centrality” for have been studied in the field of complex systems, statistical AC power networks, which describes the structure of the mechanics, and social networking [5,6], as shown in Figure 2, network as a function of its electrical topology rather than its but the two most fruitful and relevant have been the random physical topology. We compare our centrality measure to network model of Erdös and Renyi [7] and the “small world” conventional measures of network structure using the IEEE 300- bus network. We find that when measured electrically, power model inspired by the analyses in [8] and [9]. In the random networks appear to have a scale-free network structure. Thus, network model, nodes and edges are connected randomly. The unlike previous studies of the structure of power grids, we find small-world network is defined largely by relatively short that power networks have a number of highly-connected “hub” average path lengths between node pairs, even for very large buses. This result, and the structure of power networks in networks. One particularly important class of small-world general, is likely to have important implications for the reliability networks is the so-called “scale-free” network [10, 11], which and security of power networks. is characterized by a more heterogeneous connectivity. In a Index Terms—Scale-Free Networks, Connectivity, Cascading scale-free network, most nodes are connected to only a few Failures, Network Structure others, but a few nodes (known as hubs) are highly connected to the rest of the network.
  • Exploring Network Structure, Dynamics, and Function Using Networkx

    Exploring Network Structure, Dynamics, and Function Using Networkx

    Proceedings of the 7th Python in Science Conference (SciPy 2008) Exploring Network Structure, Dynamics, and Function using NetworkX Aric A. Hagberg ([email protected])– Los Alamos National Laboratory, Los Alamos, New Mexico USA Daniel A. Schult ([email protected])– Colgate University, Hamilton, NY USA Pieter J. Swart ([email protected])– Los Alamos National Laboratory, Los Alamos, New Mexico USA NetworkX is a Python language package for explo- and algorithms, to rapidly test new hypotheses and ration and analysis of networks and network algo- models, and to teach the theory of networks. rithms. The core package provides data structures The structure of a network, or graph, is encoded in the for representing many types of networks, or graphs, edges (connections, links, ties, arcs, bonds) between including simple graphs, directed graphs, and graphs nodes (vertices, sites, actors). NetworkX provides ba- with parallel edges and self-loops. The nodes in Net- sic network data structures for the representation of workX graphs can be any (hashable) Python object simple graphs, directed graphs, and graphs with self- and edges can contain arbitrary data; this flexibil- loops and parallel edges. It allows (almost) arbitrary ity makes NetworkX ideal for representing networks objects as nodes and can associate arbitrary objects to found in many different scientific fields. edges. This is a powerful advantage; the network struc- In addition to the basic data structures many graph ture can be integrated with custom objects and data algorithms are implemented for calculating network structures, complementing any pre-existing code and properties and structure measures: shortest paths, allowing network analysis in any application setting betweenness centrality, clustering, and degree dis- without significant software development.
  • Robustness and Assortativity for Diffusion-Like Processes in Scale

    Robustness and Assortativity for Diffusion-Like Processes in Scale

    epl draft Robustness and Assortativity for Diffusion-like Processes in Scale- free Networks G. D’Agostino1, A. Scala2,3, V. Zlatic´4 and G. Caldarelli5,3 1 ENEA - CR ”Casaccia” - Via Anguillarese 301 00123, Roma - Italy 2 CNR-ISC and Department of Physics, University of Rome “Sapienza” P.le Aldo Moro 5 00185 Rome, Italy 3 London Institute of Mathematical Sciences, 22 South Audley St Mayfair London W1K 2NY, UK 4 Theoretical Physics Division, Rudjer Boˇskovi´cInstitute, P.O.Box 180, HR-10002 Zagreb, Croatia 5 IMT Lucca Institute for Advanced Studies, Piazza S. Ponziano 6, Lucca, 55100, Italy PACS 89.75.Hc – Networks and genealogical trees PACS 05.70.Ln – Nonequilibrium and irreversible thermodynamics PACS 87.23.Ge – Dynamics of social systems Abstract – By analysing the diffusive dynamics of epidemics and of distress in complex networks, we study the effect of the assortativity on the robustness of the networks. We first determine by spectral analysis the thresholds above which epidemics/failures can spread; we then calculate the slowest diffusional times. Our results shows that disassortative networks exhibit a higher epidemi- ological threshold and are therefore easier to immunize, while in assortative networks there is a longer time for intervention before epidemic/failure spreads. Moreover, we study by computer sim- ulations the sandpile cascade model, a diffusive model of distress propagation (financial contagion). We show that, while assortative networks are more prone to the propagation of epidemic/failures, degree-targeted immunization policies increases their resilience to systemic risk. Introduction. – The heterogeneity in the distribu- propagation of an epidemic [13–15].
  • Ollivier Ricci Curvature of Directed Hypergraphs Marzieh Eidi1* & Jürgen Jost1,2

    Ollivier Ricci Curvature of Directed Hypergraphs Marzieh Eidi1* & Jürgen Jost1,2

    www.nature.com/scientificreports OPEN Ollivier Ricci curvature of directed hypergraphs Marzieh Eidi1* & Jürgen Jost1,2 Many empirical networks incorporate higher order relations between elements and therefore are naturally modelled as, possibly directed and/or weighted, hypergraphs, rather than merely as graphs. In order to develop a systematic tool for the statistical analysis of such hypergraph, we propose a general defnition of Ricci curvature on directed hypergraphs and explore the consequences of that defnition. The defnition generalizes Ollivier’s defnition for graphs. It involves a carefully designed optimal transport problem between sets of vertices. While the defnition looks somewhat complex, in the end we shall be able to express our curvature in a very simple formula, κ = µ0 − µ2 − 2µ3 . This formula simply counts the fraction of vertices that have to be moved by distances 0, 2 or 3 in an optimal transport plan. We can then characterize various classes of hypergraphs by their curvature. Principles of network analysis. Network analysis constitutes one of the success stories in the study of complex systems3,6,11. For the mathematical analysis, a network is modelled as a (perhaps weighted and/or directed) graph. One can then look at certain graph theoretical properties of an empirical network, like its degree or motiv distribution, its assortativity or clustering coefcient, the spectrum of its Laplacian, and so on. One can also compare an empirical network with certain deterministic or random theoretical models. Successful as this analysis clearly is, we nevertheless see two important limitations. One is that many of the prominent concepts and quantities used in the analysis of empirical networks are node based, like the degree sequence.
  • Social Network Analysis and Information Propagation: a Case Study Using Flickr and Youtube Networks

    Social Network Analysis and Information Propagation: a Case Study Using Flickr and Youtube Networks

    International Journal of Future Computer and Communication, Vol. 2, No. 3, June 2013 Social Network Analysis and Information Propagation: A Case Study Using Flickr and YouTube Networks Samir Akrouf, Laifa Meriem, Belayadi Yahia, and Mouhoub Nasser Eddine, Member, IACSIT 1 makes decisions based on what other people do because their Abstract—Social media and Social Network Analysis (SNA) decisions may reflect information that they have and he or acquired a huge popularity and represent one of the most she does not. This concept is called ″herding″ or ″information important social and computer science phenomena of recent cascades″. Therefore, analyzing the flow of information on years. One of the most studied problems in this research area is influence and information propagation. The aim of this paper is social media and predicting users’ influence in a network to analyze the information diffusion process and predict the became so important to make various kinds of advantages influence (represented by the rate of infected nodes at the end of and decisions. In [2]-[3], the marketing strategies were the diffusion process) of an initial set of nodes in two networks: enhanced with a word-of-mouth approach using probabilistic Flickr user’s contacts and YouTube videos users commenting models of interactions to choose the best viral marketing plan. these videos. These networks are dissimilar in their structure Some other researchers focused on information diffusion in (size, type, diameter, density, components), and the type of the relationships (explicit relationship represented by the contacts certain special cases. Given an example, the study of Sadikov links, and implicit relationship created by commenting on et.al [6], where they addressed the problem of missing data in videos), they are extracted using NodeXL tool.
  • Network Biology. Applications in Medicine and Biotechnology [Verkkobiologia

    Network Biology. Applications in Medicine and Biotechnology [Verkkobiologia

    Dissertation VTT PUBLICATIONS 774 Erno Lindfors Network Biology Applications in medicine and biotechnology VTT PUBLICATIONS 774 Network Biology Applications in medicine and biotechnology Erno Lindfors Department of Biomedical Engineering and Computational Science Doctoral dissertation for the degree of Doctor of Science in Technology to be presented with due permission of the Aalto Doctoral Programme in Science, The Aalto University School of Science and Technology, for public examination and debate in Auditorium Y124 at Aalto University (E-hall, Otakaari 1, Espoo, Finland) on the 4th of November, 2011 at 12 noon. ISBN 978-951-38-7758-3 (soft back ed.) ISSN 1235-0621 (soft back ed.) ISBN 978-951-38-7759-0 (URL: http://www.vtt.fi/publications/index.jsp) ISSN 1455-0849 (URL: http://www.vtt.fi/publications/index.jsp) Copyright © VTT 2011 JULKAISIJA – UTGIVARE – PUBLISHER VTT, Vuorimiehentie 5, PL 1000, 02044 VTT puh. vaihde 020 722 111, faksi 020 722 4374 VTT, Bergsmansvägen 5, PB 1000, 02044 VTT tel. växel 020 722 111, fax 020 722 4374 VTT Technical Research Centre of Finland, Vuorimiehentie 5, P.O. Box 1000, FI-02044 VTT, Finland phone internat. +358 20 722 111, fax + 358 20 722 4374 Technical editing Marika Leppilahti Kopijyvä Oy, Kuopio 2011 Erno Lindfors. Network Biology. Applications in medicine and biotechnology [Verkkobiologia. Lääke- tieteellisiä ja bioteknisiä sovelluksia]. Espoo 2011. VTT Publications 774. 81 p. + app. 100 p. Keywords network biology, s ystems b iology, biological d ata visualization, t ype 1 di abetes, oxida- tive stress, graph theory, network topology, ubiquitous complex network properties Abstract The concept of systems biology emerged over the last decade in order to address advances in experimental techniques.
  • Network Analysis with Nodexl

    Network Analysis with Nodexl

    Social data: Advanced Methods – Social (Media) Network Analysis with NodeXL A project from the Social Media Research Foundation: http://www.smrfoundation.org About Me Introductions Marc A. Smith Chief Social Scientist Connected Action Consulting Group [email protected] http://www.connectedaction.net http://www.codeplex.com/nodexl http://www.twitter.com/marc_smith http://delicious.com/marc_smith/Paper http://www.flickr.com/photos/marc_smith http://www.facebook.com/marc.smith.sociologist http://www.linkedin.com/in/marcasmith http://www.slideshare.net/Marc_A_Smith http://www.smrfoundation.org http://www.flickr.com/photos/library_of_congress/3295494976/sizes/o/in/photostream/ http://www.flickr.com/photos/amycgx/3119640267/ Collaboration networks are social networks SNA 101 • Node A – “actor” on which relationships act; 1-mode versus 2-mode networks • Edge B – Relationship connecting nodes; can be directional C • Cohesive Sub-Group – Well-connected group; clique; cluster A B D E • Key Metrics – Centrality (group or individual measure) D • Number of direct connections that individuals have with others in the group (usually look at incoming connections only) E • Measure at the individual node or group level – Cohesion (group measure) • Ease with which a network can connect • Aggregate measure of shortest path between each node pair at network level reflects average distance – Density (group measure) • Robustness of the network • Number of connections that exist in the group out of 100% possible – Betweenness (individual measure) F G •
  • Assortativity and Mixing

    Assortativity and Mixing

    Assortativity and Assortativity and Mixing General mixing between node categories Mixing Assortativity and Mixing Definition Definition I Assume types of nodes are countable, and are Complex Networks General mixing General mixing Assortativity by assigned numbers 1, 2, 3, . Assortativity by CSYS/MATH 303, Spring, 2011 degree degree I Consider networks with directed edges. Contagion Contagion References an edge connects a node of type µ References e = Pr Prof. Peter Dodds µν to a node of type ν Department of Mathematics & Statistics Center for Complex Systems aµ = Pr(an edge comes from a node of type µ) Vermont Advanced Computing Center University of Vermont bν = Pr(an edge leads to a node of type ν) ~ I Write E = [eµν], ~a = [aµ], and b = [bν]. I Requirements: X X X eµν = 1, eµν = aµ, and eµν = bν. µ ν ν µ Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License. 1 of 26 4 of 26 Assortativity and Assortativity and Outline Mixing Notes: Mixing Definition Definition General mixing General mixing Assortativity by I Varying eµν allows us to move between the following: Assortativity by degree degree Definition Contagion 1. Perfectly assortative networks where nodes only Contagion References connect to like nodes, and the network breaks into References subnetworks. General mixing P Requires eµν = 0 if µ 6= ν and µ eµµ = 1. 2. Uncorrelated networks (as we have studied so far) Assortativity by degree For these we must have independence: eµν = aµbν . 3. Disassortative networks where nodes connect to nodes distinct from themselves. Contagion I Disassortative networks can be hard to build and may require constraints on the eµν.
  • Deep Generative Modeling in Network Science with Applications to Public Policy Research

    Deep Generative Modeling in Network Science with Applications to Public Policy Research

    Working Paper Deep Generative Modeling in Network Science with Applications to Public Policy Research Gavin S. Hartnett, Raffaele Vardavas, Lawrence Baker, Michael Chaykowsky, C. Ben Gibson, Federico Girosi, David Kennedy, and Osonde Osoba RAND Health Care WR-A843-1 September 2020 RAND working papers are intended to share researchers’ latest findings and to solicit informal peer review. They have been approved for circulation by RAND Health Care but have not been formally edted. Unless otherwise indicated, working papers can be quoted and cited without permission of the author, provided the source is clearly referred to as a working paper. RAND’s R publications do not necessarily reflect the opinions of its research clients and sponsors. ® is a registered trademark. CORPORATION For more information on this publication, visit www.rand.org/pubs/working_papers/WRA843-1.html Published by the RAND Corporation, Santa Monica, Calif. © Copyright 2020 RAND Corporation R® is a registered trademark Limited Print and Electronic Distribution Rights This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited. Permission is given to duplicate this document for personal use only, as long as it is unaltered and complete. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial use. For information on reprint and linking permissions, please visit www.rand.org/pubs/permissions.html. The RAND Corporation is a research organization that develops solutions to public policy challenges to help make communities throughout the world safer and more secure, healthier and more prosperous.