DOCSLIB.ORG

Graph Patterns and Visualization

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Graph Patterns and Visualization Graph Patterns and Visualization Contents Graph cores.................................................1 Dyads and triads..............................................1 Motifs....................................................2 Visualisation................................................5 Mixing patterns............................................... 21 Assortative Mixing............................................. 21 Assortativity measures........................................... 22 Basic network analysis pipeline...................................... 23 Graph cores A k-core is the largest subgraph such that each vertex is connected to at least k others in subset. Every vertex in k-core has a degree ki ≥ k. (k + 1)-core is always subgraph of k-core. The core number of a vertex is the highest order of a core that contains this vertex. Dyads and triads Dyad is a pair of vertices and possible relational ties between them: * mutual • asymmetric • null (non-existent) Triad is a subgraph of three vertices and possible ties between them. Triad census :16 isomorphism classes. D - down, U - up, T - transitive, C - cyclic. Mutual dyads | assymetric dyads | null dyads. 1 Motifs Motifs are often defined as recurrent and statistically significant sub-graphs or patterns. Here, we consider motifs as sub-graphs of a given graph, which are isomorphic to defined sample. Motifs are not induced subgraphs, i.e. they do not contain all the graph edges between selected vertices. Motifs appear in a network more frequently than in a comparable random network • calculate the number of occurrences of a sub graph • evaluate the significance For G0 subgraph (motif candidate) of G, 0 0 0 FG(G ) − µR(G ) Zscore(G ) = 0 σR(G ) R - random graph, µ - mean frequency, σ -standard deviation. 2 3 4 Let’s define a simple sample motif and calculate, if it is often in our graph: #install.packages("rgl") library('igraph') sample1 = graph(c(c(1,2), c(2,3))) plot(sample1) isoclass_num = graph.isoclass(sample1) # defining number of corresponding isoclass motifs3[isoclass_num] # returns number of motifs #Here is our old friend: g = graph.famous("Zachary") motifs3 = graph.motifs(g, size =3) #Due to high computational time (isomorphism checks), `graph.motifs` are #implemented for graps of sizes 3 and 4 only. However, we can easy check numbers #for all motifs of size 4 to find more frequent patterns: motifs4 = graph.motifs(g, size =4) #The most frequent pattern is fifth. Let's draw it. plot(graph.isocreate(g,size=4, number=5)) #Not what we're looking for.. Second most frequent (seventh): plot(graph.isocreate(g,size=3, number=7)) That is certainly better. Visualisation There are currently three different functions in the igraph package which can draw graph in various ways: • plot.igraph does simple non-interactive 2D plotting to R devices. Actually it is an implementation of the plot generic function, so you can write plot(graph) instead of plot.igraph(graph). As it used the standard R devices it supports every output format for which R has an output device. The list is quite impressing: PostScript, PDF files, XFig files, SVG files, JPG, PNG and of course you can plot to the screen as well using the default devices, or the good-looking anti-aliased Cairo device. See plot.igraph for some more information. • tkplot does interactive 2D plotting using the tcltk package. It can only handle graphs of moderate size, a thousend vertices is probably already too many. Some parameters of the plotted graph can be 5 changed interactively after issuing the tkplot command: the position, color and size of the vertices and the color and width of the edges. See tkplot for details. • rglplot is an experimental function to draw graphs in 3D using OpenGL. See rglplot for some more information. Let’s draw a graph-ring using different three methods. library(igraph) library(rgl) g <- graph.ring(10) g$layout <- layout.circle plot(g) 6 4 3 5 2 6 1 7 10 8 9 #doesn't work in R Markdown tkplot(g) ## Loading required package: tcltk ## [1] 1 rglplot(g) Layout Either a function or a numeric matrix. It specifies how the vertices will be placed on the plot. Let’s demonstrate how it works on some graph. For example graph which based on barabashi model. g <- barabasi.game(50) 7 • layout.auto - tries to choose an appropriate layout function for the supplied graph, and uses that to generate the layout. plot(g, layout=layout.auto, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 8 47 26 44 35 28 21 27 6 22 14 25 39 50 2 11 1945 7 12 13 43 10 245 4620 4 9 29 1 38 34 42 36 3 174933 37 3123 30 8 41 48 32 15 16 18 40 • layout.random - simply places the vertices randomly on a square. plot(g, layout=layout.random, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 9 49 43 1 26 41 6 4 48 36 28 50 11 29 178 3 30 1415 2 23 2712 42 46 4721 945 38 22 35 24 4434 3237 39 40 10 187 33 1331 19 5 25 16 20 • layout.circle - places the vertices on a unit circle equidistantly. plot(g, layout=layout.circle, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 10 15141312 1716 1110 18 9 19 8 20 7 21 6 22 5 23 4 24 3 25 2 26 1 27 50 28 49 29 48 30 47 31 46 32 45 33 44 3435 4243 363738394041 • layout.sphere - places the vertices (approximately) uniformly on the surface of a sphere, this is thus a 3d layout. plot(g, layout=layout.sphere, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 11 2032 1931 2133 9 42 18 43 8 30 10 41 2234 2 48 7 17 44 49 29 40 11 3 501 2335 47 6 16 45 28 12 4 39 46 5 2436 15 13 38 27 37 14 25 26 • layout.fruchterman.reingold uses a force-based algorithm proposed by Fruchterman and Reingold. plot(g, layout=layout.fruchterman.reingold, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 12 16 47 40 18 44 15 26 32 30 21 50 8 37 42 3 43 11 10 38 45 36 14 4 29 27 34 5 17 1 19 23 48 49 46 6 2 24 3320 35 9 22 25 31 28 7 41 12 39 13 • layout.kamada.kawai is another force based algorithm. plot(g, layout=layout.kamada.kawai, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 13 47 26 44 21 35 13 14 12 6 25 41 7 39 2 4531 32 18 22 17 38 28 5 9 46 8 15 40 2349 1 24 36 19 3320 16 48 3 29 37 4 30 42 10 34 11 27 50 43 • layout.spring is a spring embedder algorithm. plot(g, layout=layout.spring, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 14 30 6 28 32 36 41 13 21 37 44 3 14 33 2247 381920 4248 18 401534 429498 35 26 39 4524469 1625 517 1 11 2 7 43 31 10 23 5027 12 • layout.fruchterman.reingold.grid is similar to layout.fruchterman.reingold but repelling force is calculated only between vertices that are closer to each other than a limit, so it is faster. plot(g, layout=layout.fruchterman.reingold.grid, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 15 13 47 39 35 12 28 44 7 6 22 21 48 26 14 2 37 25 3823 36 32 20 5 30 40 8 491 33 3 15 45 17 46 9 24 19 16 18 4 31 29 34 10 42 41 50 11 43 27 • layout.lgl is for large connected graphs, it is similar to the layout generator of the Large Graph Layout software http://lgl.sourceforge.net/. plot(g, layout=layout.lgl, vertex.size=4, vertex.label.dist=0.5, vertex.color="red", edge.arrow.size=0.5) 16 13 12 39 43 7 34 47 44 35 25 27 6 11 21 14 42 10 2 50 26 37 38 4 22 28 36 29 49 24 32 45 31 48 18 19 1 23 17 15 8 20 46 41 33 16 3 5 40 9 30 • layout.graphopt is a port of the graphopt layout algorithm by Michael Schmuhl. graphopt version 0.4.1 was rewritten in C and the support for layers was removed (might be added later) and a code was a bit reorganized to avoid some unneccessary steps is the node charge (see below) is zero. • layout.svd is a currently experimental layout function based on singular value decomposition. • layout.norm normalizes a layout, it linearly transforms each coordinate separately to fit into the given limits. • layout.drl is another force-driven layout generator, it is suitable for quite large graphs. • layout.reingold.tilford generates a tree-like layout, so it is mainly for tree. Highlight components Let’s make different color for each graph component g <- erdos.renyi.game(100,1/100) l <- layout.fruchterman.reingold(g) op = par(mfrow = c(1,2)) plot(g, layout=l, vertex.size=5, vertex.label=NA) comps <- clusters(g)$membership colbar <- rainbow(max(comps)+1) 17 V(g)$color <- colbar[comps+1] plot(g, layout=l, vertex.size=5, vertex.label=NA) Highlight communities in graph Let’s make different color for each community g <- graph.full(5) %du% graph.full(5) %du% graph.full(5) g <- add.edges(g, c(1,6,1,11,6,11)) op = par(mfrow = c(1,2)) plot(g, layout = layout.kamada.kawai) com <- spinglass.community(g, spins=5) V(g)$color <- com$membership+1 g <- set.graph.attribute(g, "layout", layout.kamada.kawai(g)) plot(g, vertex.label.dist=1.5) 18 3 2 3 7 9 4 2 12 5 10 14 1 5 1 6 4 11 15 8 13 11 6 14 8 15 7 9 12 13 10 par(op) Trees Visualization plot(graph.tree(50,2)) 19 41 40 4544 43 33 20 32 22 21 42 34 16 10 46 11 23 35 17 8 5 47 4 2 38 19 9 39 1 18 48 37 3 24 36 6 12 49 7 13 25 14 50 28 15 2627 29 30 31 We can use layout = layout.reingold.tilford to draw tree plot(graph.tree(50,2), vertex.size=3, vertex.label=NA, layout=layout.reingold.tilford) 20 tkplot(graph.tree(50,2, mode="undirected"), vertex.size=10, vertex.color="green") ## [1] 2 Mixing patterns • Assortative mixing, “like links with like”, attributed of connected nodes tend to be more similar than if there were no such edge • Disassortative mixing, “like links with dislike”, attributed of connected nodes tend to be less similar than if there were no such edge Examples: • assortative mixing - in social networks political beliefs, obesity, race • disassortative mixing - dating network, food web (predator/prey), economic networks (produc- ers/consumers) Assortative Mixing Assortative Mixing coefficient shows whether nodes with the same attribute values tend to form connections.
Load more

Recommended publications
  • 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].
    [Show full text]
  • 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.
    [Show full text]
  • 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µν.
    [Show full text]
  • Extraction and Analysis of Facebook Friendship Relations
    Chapter 12 Extraction and Analysis of Facebook Friendship Relations Salvatore Catanese, Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, and Alessandro Provetti Abstract Online social networks (OSNs) are a unique web and social phenomenon, affecting tastes and behaviors of their users and helping them to maintain/create friendships. It is interesting to analyze the growth and evolution of online social networks both from the point of view of marketing and offer of new services and from a scientific viewpoint, since their structure and evolution may share similarities with real-life social networks. In social sciences, several techniques for analyzing (off-line) social networks have been developed, to evaluate quantitative properties (e.g., defining metrics and measures of structural characteristics of the networks) or qualitative aspects (e.g., studying the attachment model for the network evolution, the binary trust relationships, and the link prediction problem). However, OSN analysis poses novel challenges both to computer and Social scientists. We present our long-term research effort in analyzing Facebook, the largest and arguably most successful OSN today: it gathers more than 500 million users. Access to data about Facebook users and their friendship relations is restricted; thus, we acquired the necessary information directly from the front end of the website, in order to reconstruct a subgraph representing anonymous interconnections among a significant subset of users. We describe our ad hoc, privacy-compliant crawler for Facebook data extraction. To minimize bias, we adopt two different graph mining techniques: breadth-first-search (BFS) and rejection sampling. To analyze the structural properties of samples consisting of millions of nodes, we developed a S.Catanese•P.DeMeo•G.Fiumara Department of Physics, Informatics Section.
    [Show full text]
  • The Perceived Assortativity of Social Networks: Methodological Problems and Solutions
    The perceived assortativity of social networks: Methodological problems and solutions David N. Fisher1, Matthew J. Silk2 and Daniel W. Franks3 Abstract Networks describe a range of social, biological and technical phenomena. An important property of a network is its degree correlation or assortativity, describing how nodes in the network associate based on their number of connections. Social networks are typically thought to be distinct from other networks in being assortative (possessing positive degree correlations); well-connected individuals associate with other well-connected individuals, and poorly-connected individuals associate with each other. We review the evidence for this in the literature and find that, while social networks are more assortative than non-social networks, only when they are built using group-based methods do they tend to be positively assortative. Non-social networks tend to be disassortative. We go on to show that connecting individuals due to shared membership of a group, a commonly used method, biases towards assortativity unless a large enough number of censuses of the network are taken. We present a number of solutions to overcoming this bias by drawing on advances in sociological and biological fields. Adoption of these methods across all fields can greatly enhance our understanding of social networks and networks in general. 1 1. Department of Integrative Biology, University of Guelph, Guelph, ON, N1G 2W1, Canada. Email: [email protected] (primary corresponding author) 2. Environment and Sustainability Institute, University of Exeter, Penryn Campus, Penryn, TR10 9FE, UK Email: [email protected] 3. Department of Biology & Department of Computer Science, University of York, York, YO10 5DD, UK Email: [email protected] Keywords: Assortativity; Degree assortativity; Degree correlation; Null models; Social networks Introduction Network theory is a useful tool that can help us explain a range of social, biological and technical phenomena (Pastor-Satorras et al 2001; Girvan and Newman 2002; Krause et al 2007).
    [Show full text]
  • Assortativity Measures for Weighted and Directed Networks
    Assortativity measures for weighted and directed networks Yelie Yuan1, Jun Yan1, and Panpan Zhang2,∗ 1Department of Statistics, University of Connecticut, Storrs, CT 06269 2Department of Biostatistics, Epidemiology and Informatics, University of Pennsylvania, Philadelphia, PA 19104 ∗Corresponding author: [email protected] January 15, 2021 arXiv:2101.05389v1 [stat.AP] 13 Jan 2021 Abstract Assortativity measures the tendency of a vertex in a network being connected by other ver- texes with respect to some vertex-specific features. Classical assortativity coefficients are defined for unweighted and undirected networks with respect to vertex degree. We propose a class of assortativity coefficients that capture the assortative characteristics and structure of weighted and directed networks more precisely. The vertex-to-vertex strength correlation is used as an example, but the proposed measure can be applied to any pair of vertex-specific features. The effectiveness of the proposed measure is assessed through extensive simula- tions based on prevalent random network models in comparison with existing assortativity measures. In application World Input-Ouput Networks, the new measures reveal interesting insights that would not be obtained by using existing ones. An implementation is publicly available in a R package wdnet. 1 Introduction In traditional network analysis, assortativity or assortative mixing (Newman, 2002) is a mea- sure assessing the preference of a vertex being connected (by edges) with other vertexes in a network. The measure reflects the principle of homophily (McPherson et al., 2001)|the tendency of the entities to be associated with similar partners in a social network. The prim- itive assortativity measure proposed by Newman(2002) was defined to study the tendency of connections between nodes based on their degrees, which is why it is also called degree-degree correlation (van der Hofstad and Litvak, 2014).
    [Show full text]
  • Spatial Analysis and Modeling of Urban Transportation Networks
    Spatial analysis and modeling of urban transportation networks Jingyi Lin Doctoral Thesis in Geodesy and Geoinformatics with Specialization in Geoinformatics Royal Institute of Technology Stockholm, Sweden, 2017 TRITA SoM 2017-15 ISRN KTH/SoM/2017-15/SE ISBN 978-91-7729-613-3 Doctoral Thesis Royal Institute of Technology (KTH) Department of Urban Planning and Environment Division of Geodesy and Geoinformatics SE-100 44 Stockholm Sweden © Jingyi Lin, 2017 Printed by US AB, Sweden 2017 Abstract Transport systems in general, and urban transportation systems in particular, are the backbone of a country or a city, therefore play an intrinsic role in the socio- economic development. There have been numerous studies on real transportation systems from multiple fileds, including geography, urban planning, and engineering. Geographers have extensively investigated transportation systems, and transport geography has developed as an important branch of geography with various studies on system structure, efficiency optimization, and flow distribution. However, the emergence of complex network theory provided a brand-new perspective for geographers and other researchers; therefore, it invoked more widespread interest in exploring transportation systems that present a typical node-link network structure. This trend inspires the author and, to a large extent, constitutes the motivation of this thesis. The overall objective of this thesis is to study and simulate the structure and dynamics of urban transportation systems, including aviation systems and ground transportation systems. More specificically, topological features, geometric properties, and dynamic evolution processes are explored and discussed in this thesis. To illustrate different construction mechanisms, as well as distinct evolving backgrounds of aviation systems and ground systems, China’s aviation network, U.S.
    [Show full text]
  • Edge Direction and the Structure of Networks
    Edge direction and the structure of networks Jacob G. Foster1, David V. Foster, Peter Grassberger, and Maya Paczuski Complexity Science Group, Department of Physics and Astronomy, University of Calgary, 2500 University Drive NW, Calgary, AB, Canada T2N 1N4 Edited by H. Eugene Stanley, Boston University, Boston, MA, and approved April 6, 2010 (received for review November 2, 2009) Directed networks are ubiquitous and are necessary to represent In directed networks, an edge from source to target (A → B) complex systems with asymmetric interactions—from food webs represents an asymmetric interaction; for example, that Web site to the World Wide Web. Despite the importance of edge direction A contains a hyperlink to Web site B, or organism A is eaten for detecting local and community structure, it has been disregarded by organism B. Edge direction is essential to evaluate and explain in studying a basic type of global diversity in networks: the tendency local structure in such networks. For instance, motif analysis of nodes with similar numbers of edges to connect. This tendency, (13, 14) identifies local connection patterns that appear more called assortativity, affects crucial structural and dynamic properties frequently in the real-world network than in ensembles of rando- of real-world networks, such as error tolerance or epidemic spread- mized networks. In this context, edge direction distinguishes ing. Here we demonstrate that edge direction has profound effects functional units like feed-forward and feedback loops. Takingedge on assortativity. We define a set of four directed assortativity mea- direction into account also overturns the simple picture of the sures and assign statistical significance by comparison to rando- World Wide Web (WWW) as having a short average distance mized networks.
    [Show full text]
  • Positive Network Assortativity of Influenza Vaccination at a High School: Implications for Outbreak Risk and Herd Immunity
    Positive Network Assortativity of Influenza Vaccination at a High School: Implications for Outbreak Risk and Herd Immunity Victoria C. Barclay1*., Timo Smieszek1.¤a¤b, Jianping He2, Guohong Cao2, Jeanette J. Rainey3, Hongjiang Gao3, Amra Uzicanin3, Marcel Salathe´ 1 1 Center for Infectious Disease Dynamics, Department of Biology, The Pennsylvania State University, University Park, Pennsylvania, United States of America, 2 Department of Computer Science and Engineering, The Pennsylvania State University, University Park, Pennsylvania, United States of America, 3 Division of Global Migration and Quarantine, Centers for Disease Control and Prevention, Atlanta, Georgia, United States of America Abstract Schools are known to play a significant role in the spread of influenza. High vaccination coverage can reduce infectious disease spread within schools and the wider community through vaccine-induced immunity in vaccinated individuals and through the indirect effects afforded by herd immunity. In general, herd immunity is greatest when vaccination coverage is highest, but clusters of unvaccinated individuals can reduce herd immunity. Here, we empirically assess the extent of such clustering by measuring whether vaccinated individuals are randomly distributed or demonstrate positive assortativity across a United States high school contact network. Using computational models based on these empirical measurements, we further assess the impact of assortativity on influenza disease dynamics. We found that the contact network was positively assortative with respect to influenza vaccination: unvaccinated individuals tended to be in contact more often with other unvaccinated individuals than with vaccinated individuals, and these effects were most pronounced when we analyzed contact data collected over multiple days. Of note, unvaccinated males contributed substantially more than unvaccinated females towards the measured positive vaccination assortativity.
    [Show full text]
  • Basics of Network Analysis
    Basics of Network Analysis Hiroki Sayama [email protected] Graph = Network • G(V, E): graph (network) V: vertices (nodes), E: edges (links) 1 Nodes = 1, 2, 3, 4, 5 Links = 1<->2, 1<->3, 1<->5, 3 2 2<->3, 2<->4, 2<->5, 3<->4, 3<->5, 4<->5 4 (Nodes may have states; links may have directions and weights) 5 2 Representation of a network • Adjacency matrix: A matrix with rows and columns labeled by nodes, where element aij shows the number of links going from node i to node j (becomes symmetric for undirected graph) • Adjacency list: A list of links whose element “i->j” shows a link going from node i to node j (also represented as “i -> {j1, j2, j3, …}”) 3 Exercise • Represent the following network in: 1 – Adjacency matrix 3 – Adjacency list 2 4 5 4 Degree of a node • A degree of node u, deg(u), is the number of links connected to u u1 u2 deg(u1) = 4 deg(u2) = 2 5 Connected graph • A graph in which there is a path between any pair of nodes 6 Connected components Connected Number of component connected components = 2 Connected component 7 Complete graph • A graph in which any pair of nodes are connected (often written as K1, K2, …) 8 Regular graph • A graph in which all nodes have the same degree (often called k-regular graph with degree k) 9 Bipartite graph • A graph whose nodes can be divided into two subsets so that no link connects nodes within the same subset = 10 Directed graph • Each link is directed • Direction repre- sents either order of relationship or accessibility between nodes E.g.
    [Show full text]
  • Immunization Strategies in Directed Networks
    MBE, 17(4): 3925–3952. DOI: 10.3934/mbe.2020218 Received: 12 March 2020 Accepted: 20 May 2020 http://www.aimspress.com/journal/MBE Published: 28 May 2020 Research article Immunization strategies in directed networks Junbo Jia, Wei Shi, Pan Yang and Xinchu Fu∗ Department of Mathematics, Shanghai University, Shanghai 200444, China * Correspondence: Email: [email protected]; Tel: +862166132664; Fax: +862166133292. Abstract: Many complex systems can be modeled as directed networks, which can be regarded as a generalization of undirected networks. In this paper, epidemic dynamics and immunization strategies in directed networks are studied. First, a Susceptible-Infected-Susceptible (SIS) model on a directed network is established employing the mean-field method, and its dynamics and epidemic threshold of the network are studied. Then based on the continuous degree technique, namely, considering the degree of a node as a continuous variable, we propose a method to calculate the epidemic threshold of the immunized network. Besides, some immunization strategies, including optimal immunization, random immunization, combined targeted immunization, and combined acquaintance immunization, and three special networks are considered. Finally, through numerical analysis, all immunization strategies are simulated and compared on different types of networks. We find that the nodes with the largest product of in-degree and out-degree are the most worthy of being immunized. Keywords: directed network; optimal immunization; random immunization; combined targeted immunization; combined acquaintance immunization 1. Introduction Complex network is a powerful tool to describe and study complex systems [1]. Generally, the network is represented by a graph in mathematics, including nodes, which represent the individual component in the system, and edges between the nodes, which represent the relationship or interaction between individuals in the system.
    [Show full text]
  • Co-Posting Author Assortativity in Reddit
    Co-posting Author Assortativity in Reddit Francesco Cauteruccio1, Enrico Corradini2, Giorgio Terracina1, Domenico Ursino2, and Luca Virgili2 1 DEMACS, University of Calabria 2 DII, Polytechnic University of Marche Abstract. In the context of social networks, a renowned paper of New- man introduced the notion of \assortativity", also known as \assortative mixing". Strictly akin to the concept of homophily, it shows how much a node tends to associate with other nodes somewhat similar to it. Degree centrality is the most used similarity metrics for evaluating assortativ- ity between nodes, but several more could be dealt with. Assortativity was deeply investigated in many past researches, given different social platforms. However, Reddit was not one of the social networks taken into account, even if it is a really popular social medium. In this paper, we want to find out the possible presence of a form of assortativity in Reddit; in particular, we focus our analysis on co-posters, i.e. authors posting contents on the same subreddit. Keywords: Reddit; Co-posters; Assortativity; Social Network Analysis; De- gree Centrality 1 Introduction Assortativity and degree assortativity were introduced in a renowned paper of Newman [17]. Here, the author defines a measure of assortativity for networks showing that real social networks are often assortative, whereas technological and biological networks tend to be disassortative. He also models an assortative net- work and exploits it for analytic and numeric studies. At the end of this analysis, he finds that assortative networks tend to percolate more easily than disassor- tative ones and that they are more robust to node removal.
    [Show full text]