DOCSLIB.ORG

Section 7.13: Homophily (Or Assortativity)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Section 7.13: Homophily (Or Assortativity) Section 7.13: Homophily (or Assortativity) By: Ralucca Gera, NPS Are hubs adjacent to hubs? • How does a node’s degree relate to its neighbors’ degree? • Real networks usually show a non-zero degree correlation (defined later compared to random). • If it is positive, the network is said to have assortatively mixed degrees (assortativity based other attributes can also be considered). • If it is negative, it is disassortatively mixed. • According to Newman, social networks tend to be assortatively mixed, while other kinds of networks are generally disassortatively mixed. 2 Partitioning the network Sociologists have observed network partitioning based on the following characteristics: – Friendships, aquintances, business relationships – Relationships based on certain characteristics: •Age • Nationality • Language • Education • Income level Homophily: It is the tendency of individuals to choose friends with similar characteristic. “Like links with like.” Example of homophily 4 http://www.slideshare.net/NicolaBarbieri/homophily-and-influence-in-social-networks Assortativity by race James Moody 5 Homophily or Assortative mixing Friendship networks at a US highschool • Homophily (or assortative mixing) is the strong tendency of people to associate with others whom they perceive are similar to themselves in some way • Disassortative mixing is the tendency for people to associate with others who are unlike them (such as gender in sexual contact networks, where the majority of partnerships are between opposite sex individuals) 6 Assortative mixing Titter data: political retweet network Red = Republicans Blue = Democrats Note that they mostly tweet and re-tweet to each other Conover et at., 2011 7 Homophily (or Assortative mixing) Homophily or assortativity is a common property of social networks (but not necessary): – Papers in citation networks tend to cite papers in the same field – Websites tend to point to websites in the same language – Political views – Race – Obesity 8 Homophily in Gephi here https://gephi.org/tutorials/gephi-tutorial-layouts.pdf 9 Homophily in Python • In NetworkX, to check degree Assortativity: r = nx.attribute_assortativity_coefficient(G) • To check an attribute’s assortativity: assortivity_val=nx.attribute_assortativity_coefficient(G, "color“) The attribute “color” can be replaced by other attributes that your data was tagged with. 10 Disassortative • Disassortative mixing: “like links with dislike”. • Dissasortative networks are the ones in which adjacent nodes tend to be dissimilar: – Dating network (females/males) – Food web (predator/prey) – Economic networks (producers/consumers) 11 Assortative mixing (homophily) We will study two types of assortative mixing: 1. Based on enumerative characteristics (the characteristics don’t fall in any particular order), such as: 1. Nationality 2. Race 3. Gender 2. Based on scalar characteristics, such as: 1. Age 2. Income 3. By degree: high degree connect to high degree 12 Based on enumerative characteristics (characteristics that don’t fall in any particular order), such as: 1. Nationality 2. Race 3. Gender 13 Possible defn assortativity •A network is assortative if there is a significant fraction of the edges between same-type vertices • How to quantify how assortative the network is? • Let be the assortative class of vertex i, # •S = Then: What is the assortativity if we consider V(G) as the only class? Does it make sense? 14 Alternative definitions Alternate defintions, as before, will allow to compare the Assortativity of the current network to the one of a random graph: • Compute the fraction of edges in in the given network • Compute the fraction of edges in in a random graph • Consider their difference 15 Compute the fraction of edges in in the given network • Let be the class of vertex i • Let be the total number of classes • Let ) = be the Kronecker that accounts for vertices in the same class. • Then the number of edges of the same type is: ∈ Checks if vertices are in the same class 16 Compute the fraction of edges in in the random network • Construct a random graph with the same degree distrib. • Let be the class of vertex i • Let be the total number of classes Checks if vertices are in the same class • Let ( ) = be the Kronecker • Pick an arbitrary edge in the random graph: – pick a vertex i → there are deg edges incident with it, so deg choices for i to be the 1st end vertex of our arbitrary edge – and then there are deg choices for j to be the other end • If edges are placed at random, the expected number of edges between i and j is || || || # of vertices at the end of the |E(G)| edges 17 Compute the fraction of edges in in the random network • Let be the class of vertex i • Let be the total number of classes Checks if vertices are in the same class • Let ( ) = be the Kronecker • The expected number of edges between i and j if m edges are placed at random is || • Then the number of edges of the same type is: ∈ duplications: as you choose vertex j above, the edge ji will be counted after edge ij was counted 18 Consider their difference - ∈ || Checks if vertices = are in the same class || And now normalize by m = |E(G)|: Modularity = Which is the same defn as the modularity in community detection (assortativity based on deg).19 Modularity •Q = ∑ ∙ , Checks if vertices || are in the same class • Measure used to quantify the like vertices being connected to like vertices • -1 < Q < 0 means there are fewer edges between like vertices in a class compared to a random network i.e. disassortative network • 0 < Q < 1 means there are more edges between like vertices in a class compared to a random network i.e. assortative network • Q = 0 means it behaves like a random network. 20 Ranges of the modularity values • Range: -1 < Q < 1 • However, it never reaches 1 (we’ll see shortly), even in a perfectly assortative network (where all like nodes are adjacent) • The modularity is generally far from 1 • So what is a good modularity value (Q > ?) that says the network is assortative? • Should we normalize Q again? What are some choices? 21 Enumerative characteristics • We normalize the modularity value Q, by the maximum value that it can get – Perfect mixing is when all edges fall between vertices of the same type ∑ 1 1 kik j Qmax (2m (ci,cj )) 2m ij 2m • Then, the assortativity coefficient is given by: (/2)(,)Akkmcc Q ij ij i j i j 11 Qmkkmcc2(/2)(,) max ij ij i j 22 Alternative form for edge list • An alternative faster to compute formula, if the network is given by a list of edges rather than adjacency matrix: 1 • Let e rs A ij ( c i , r ) ( c j , s ) be the fraction of 2m edges that joinij vertices of type to vertices of type 1 • Letar ki(ci,r) be the fraction of ends of 2m edges attachedij to vertices of type r • We further have that the edges between group and is (ci,cj ) (ci,r)(cj,r) r 23 Alternative form for edge list 1 kik j Q Aij (ci,r)(c j,r) 2m ij 2m r 1 1 1 Aij(ci,r)(cj,r) ki(ci,r) ki(c j,r) r 2m ij 2m i 2m j 2 (err ar ) r 1 Where we defined a r k i ( c i, r ) is the fraction of edges 2m ij 1 between nodes of type and e rs A ij ( c i , r ) ( c j, s ) is the fraction 2m of edges between and , ij 24 and deg Based on scalar characteristics, such as: 1. Age 2. Income 25 Scalar characteristics • Scalar characteristics take values that come in a particular order (enumerative) and take numerical values – Such as age, income – Age: In this case two people can be considered similar if they are born the same day or within a year or within x years etc. • If people are friends with others of the same age, we consider the network assortatively mixed by age (or stratified by age) 26 Assortativity by race James Moody 27 Assortativity by grade/age James Moody 28 Scalar characteristics • When we consider scalar characteristics we basically have an approximate notion of similarity between adjacent vertices (i.e. how far/close the values are) –There is no approximate similarity that can be measured this way when we talk about enumerative characteristics; rather present/absent 29 Recall Friendship networks at a US highschool • Homophily (or assortative mixing) is the strong tendency of people to associate with others whom they perceive are similar to themselves in some way • Disassortative mixing is the tendency for people to associate with others who are unlike them (such as gender in sexual contact networks, where the majority of partnerships are between opposite sex individuals) 30 Scalar characteristics Denser along the Friendships at the y = x line same US high school: (because of the each dot represents a way data is friendship (an edge displayed) from the network) Sparser as the difference in grades increases 31 Strongly assortative • Top: scatter plot of 1141 married couples • Bottom: same data showing a histogram of the age difference • Data: 1995 US National Survey of Family Growth Newman, Phys Rev E. 67, 026126 (2003) 32 Scalar characteristics • How do we measure this assortative mixing? • Would the idea of the enumartive assortative mixing work? • That is to place vertices in bins based on scalar values: – Treat vertices that fall in the same bin (such as age) as “like vertices” or “identical” – Apply modularity metric for enumerative characteristics 33 Scalar characteristics This approach misses much of the point of scalar part of the scalar characteristics – Why are two vertices identical if they are in the same
Load more

Recommended publications
  • Sagemath and Sagemathcloud
    Viviane Pons Ma^ıtrede conf´erence,Universit´eParis-Sud Orsay [email protected] { @PyViv SageMath and SageMathCloud Introduction SageMath SageMath is a free open source mathematics software I Created in 2005 by William Stein. I http://www.sagemath.org/ I Mission: Creating a viable free open source alternative to Magma, Maple, Mathematica and Matlab. Viviane Pons (U-PSud) SageMath and SageMathCloud October 19, 2016 2 / 7 SageMath Source and language I the main language of Sage is python (but there are many other source languages: cython, C, C++, fortran) I the source is distributed under the GPL licence. Viviane Pons (U-PSud) SageMath and SageMathCloud October 19, 2016 3 / 7 SageMath Sage and libraries One of the original purpose of Sage was to put together the many existent open source mathematics software programs: Atlas, GAP, GMP, Linbox, Maxima, MPFR, PARI/GP, NetworkX, NTL, Numpy/Scipy, Singular, Symmetrica,... Sage is all-inclusive: it installs all those libraries and gives you a common python-based interface to work on them. On top of it is the python / cython Sage library it-self. Viviane Pons (U-PSud) SageMath and SageMathCloud October 19, 2016 4 / 7 SageMath Sage and libraries I You can use a library explicitly: sage: n = gap(20062006) sage: type(n) <c l a s s 'sage. interfaces .gap.GapElement'> sage: n.Factors() [ 2, 17, 59, 73, 137 ] I But also, many of Sage computation are done through those libraries without necessarily telling you: sage: G = PermutationGroup([[(1,2,3),(4,5)],[(3,4)]]) sage : G . g a p () Group( [ (3,4), (1,2,3)(4,5) ] ) Viviane Pons (U-PSud) SageMath and SageMathCloud October 19, 2016 5 / 7 SageMath Development model Development model I Sage is developed by researchers for researchers: the original philosophy is to develop what you need for your research and share it with the community.
    [Show full text]
  • Networkx Tutorial
    5.03.2020 tutorial NetworkX tutorial Source: https://github.com/networkx/notebooks (https://github.com/networkx/notebooks) Minor corrections: JS, 27.02.2019 Creating a graph Create an empty graph with no nodes and no edges. In [1]: import networkx as nx In [2]: G = nx.Graph() By definition, a Graph is a collection of nodes (vertices) along with identified pairs of nodes (called edges, links, etc). In NetworkX, nodes can be any hashable object e.g. a text string, an image, an XML object, another Graph, a customized node object, etc. (Note: Python's None object should not be used as a node as it determines whether optional function arguments have been assigned in many functions.) Nodes The graph G can be grown in several ways. NetworkX includes many graph generator functions and facilities to read and write graphs in many formats. To get started though we'll look at simple manipulations. You can add one node at a time, In [3]: G.add_node(1) add a list of nodes, In [4]: G.add_nodes_from([2, 3]) or add any nbunch of nodes. An nbunch is any iterable container of nodes that is not itself a node in the graph. (e.g. a list, set, graph, file, etc..) In [5]: H = nx.path_graph(10) file:///home/szwabin/Dropbox/Praca/Zajecia/Diffusion/Lectures/1_intro/networkx_tutorial/tutorial.html 1/18 5.03.2020 tutorial In [6]: G.add_nodes_from(H) Note that G now contains the nodes of H as nodes of G. In contrast, you could use the graph H as a node in G.
    [Show full text]
  • 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
    [Show full text]
  • Detecting Statistically Significant Communities
    1 Detecting Statistically Significant Communities Zengyou He, Hao Liang, Zheng Chen, Can Zhao, Yan Liu Abstract—Community detection is a key data analysis problem across different fields. During the past decades, numerous algorithms have been proposed to address this issue. However, most work on community detection does not address the issue of statistical significance. Although some research efforts have been made towards mining statistically significant communities, deriving an analytical solution of p-value for one community under the configuration model is still a challenging mission that remains unsolved. The configuration model is a widely used random graph model in community detection, in which the degree of each node is preserved in the generated random networks. To partially fulfill this void, we present a tight upper bound on the p-value of a single community under the configuration model, which can be used for quantifying the statistical significance of each community analytically. Meanwhile, we present a local search method to detect statistically significant communities in an iterative manner. Experimental results demonstrate that our method is comparable with the competing methods on detecting statistically significant communities. Index Terms—Community Detection, Random Graphs, Configuration Model, Statistical Significance. F 1 INTRODUCTION ETWORKS are widely used for modeling the structure function that is able to always achieve the best performance N of complex systems in many fields, such as biology, in all possible scenarios. engineering, and social science. Within the networks, some However, most of these objective functions (metrics) do vertices with similar properties will form communities that not address the issue of statistical significance of commu- have more internal connections and less external links.
    [Show full text]
  • Networks in Nature: Dynamics, Evolution, and Modularity
    Networks in Nature: Dynamics, Evolution, and Modularity Sumeet Agarwal Merton College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Hilary 2012 2 To my entire social network; for no man is an island Acknowledgements Primary thanks go to my supervisors, Nick Jones, Charlotte Deane, and Mason Porter, whose ideas and guidance have of course played a major role in shaping this thesis. I would also like to acknowledge the very useful sug- gestions of my examiners, Mark Fricker and Jukka-Pekka Onnela, which have helped improve this work. I am very grateful to all the members of the three Oxford groups I have had the fortune to be associated with: Sys- tems and Signals, Protein Informatics, and the Systems Biology Doctoral Training Centre. Their companionship has served greatly to educate and motivate me during the course of my time in Oxford. In particular, Anna Lewis and Ben Fulcher, both working on closely related D.Phil. projects, have been invaluable throughout, and have assisted and inspired my work in many different ways. Gabriel Villar and Samuel Johnson have been col- laborators and co-authors who have helped me to develop some of the ideas and methods used here. There are several other people who have gener- ously provided data, code, or information that has been directly useful for my work: Waqar Ali, Binh-Minh Bui-Xuan, Pao-Yang Chen, Dan Fenn, Katherine Huang, Patrick Kemmeren, Max Little, Aur´elienMazurie, Aziz Mithani, Peter Mucha, George Nicholson, Eli Owens, Stephen Reid, Nico- las Simonis, Dave Smith, Ian Taylor, Amanda Traud, and Jeffrey Wrana.
    [Show full text]
  • Network Analysis of the Multimodal Freight Transportation System in New York City
    Network Analysis of the Multimodal Freight Transportation System in New York City Project Number: 15 – 2.1b Year: 2015 FINAL REPORT June 2018 Principal Investigator Qian Wang Researcher Shuai Tang MetroFreight Center of Excellence University at Buffalo Buffalo, NY 14260-4300 Network Analysis of the Multimodal Freight Transportation System in New York City ABSTRACT The research is aimed at examining the multimodal freight transportation network in the New York metropolitan region to identify critical links, nodes and terminals that affect last-mile deliveries. Two types of analysis were conducted to gain a big picture of the region’s freight transportation network. First, three categories of network measures were generated for the highway network that carries the majority of last-mile deliveries. They are the descriptive measures that demonstrate the basic characteristics of the highway network, the network structure measures that quantify the connectivity of nodes and links, and the accessibility indices that measure the ease to access freight demand, services and activities. Second, 71 multimodal freight terminals were selected and evaluated in terms of their accessibility to major multimodal freight demand generators such as warehousing establishments. As found, the most important highways nodes that are critical in terms of connectivity and accessibility are those in and around Manhattan, particularly the bridges and tunnels connecting Manhattan to neighboring areas. Major multimodal freight demand generators, such as warehousing establishments, have better accessibility to railroad and marine port terminals than air and truck terminals in general. The network measures and findings in the research can be used to understand the inventory of the freight network in the system and to conduct freight travel demand forecasting analysis.
    [Show full text]
  • Modularity in Static and Dynamic Networks
    Modularity in static and dynamic networks Sarah F. Muldoon University at Buffalo, SUNY OHBM – Brain Graphs Workshop June 25, 2017 Outline 1. Introduction: What is modularity? 2. Determining community structure (static networks) 3. Comparing community structure 4. Multilayer networks: Constructing multitask and temporal multilayer dynamic networks 5. Dynamic community structure 6. Useful references OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Introduction: What is Modularity? OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon What is Modularity? Modularity (Community Structure) • A module (community) is a subset of vertices in a graph that have more connections to each other than to the rest of the network • Example social networks: groups of friends Modularity in the brain: • Structural networks: communities are groups of brain areas that are more highly connected to each other than the rest of the brain • Functional networks: communities are groups of brain areas with synchronous activity that is not synchronous with other brain activity OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The Brain is Modular Structural networks: cortical thickness correlations sensorimotor/spatial strategic/executive mnemonic/emotion olfactocentric auditory/language visual processing Chen et al. (2008) Cereb Cortex OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The Brain is Modular • Functional networks: resting state fMRI He et al. (2009) PLOS One OHBM 2017 – Brain Graphs Workshop – Sarah F. Muldoon Findings: The
    [Show full text]
  • Graph Database Fundamental Services
    Bachelor Project Czech Technical University in Prague Faculty of Electrical Engineering F3 Department of Cybernetics Graph Database Fundamental Services Tomáš Roun Supervisor: RNDr. Marko Genyk-Berezovskyj Field of study: Open Informatics Subfield: Computer and Informatic Science May 2018 ii Acknowledgements Declaration I would like to thank my advisor RNDr. I declare that the presented work was de- Marko Genyk-Berezovskyj for his guid- veloped independently and that I have ance and advice. I would also like to thank listed all sources of information used Sergej Kurbanov and Herbert Ullrich for within it in accordance with the methodi- their help and contributions to the project. cal instructions for observing the ethical Special thanks go to my family for their principles in the preparation of university never-ending support. theses. Prague, date ............................ ........................................... signature iii Abstract Abstrakt The goal of this thesis is to provide an Cílem této práce je vyvinout webovou easy-to-use web service offering a database službu nabízející databázi neorientova- of undirected graphs that can be searched ných grafů, kterou bude možno efektivně based on the graph properties. In addi- prohledávat na základě vlastností grafů. tion, it should also allow to compute prop- Tato služba zároveň umožní vypočítávat erties of user-supplied graphs with the grafové vlastnosti pro grafy zadané uži- help graph libraries and generate graph vatelem s pomocí grafových knihoven a images. Last but not least, we implement zobrazovat obrázky grafů. V neposlední a system that allows bulk adding of new řadě je také cílem navrhnout systém na graphs to the database and computing hromadné přidávání grafů do databáze a their properties.
    [Show full text]
  • Multidimensional Network Analysis
    Universita` degli Studi di Pisa Dipartimento di Informatica Dottorato di Ricerca in Informatica Ph.D. Thesis Multidimensional Network Analysis Michele Coscia Supervisor Supervisor Fosca Giannotti Dino Pedreschi May 9, 2012 Abstract This thesis is focused on the study of multidimensional networks. A multidimensional network is a network in which among the nodes there may be multiple different qualitative and quantitative relations. Traditionally, complex network analysis has focused on networks with only one kind of relation. Even with this constraint, monodimensional networks posed many analytic challenges, being representations of ubiquitous complex systems in nature. However, it is a matter of common experience that the constraint of considering only one single relation at a time limits the set of real world phenomena that can be represented with complex networks. When multiple different relations act at the same time, traditional complex network analysis cannot provide suitable an- alytic tools. To provide the suitable tools for this scenario is exactly the aim of this thesis: the creation and study of a Multidimensional Network Analysis, to extend the toolbox of complex network analysis and grasp the complexity of real world phenomena. The urgency and need for a multidimensional network analysis is here presented, along with an empirical proof of the ubiquity of this multifaceted reality in different complex networks, and some related works that in the last two years were proposed in this novel setting, yet to be systematically defined. Then, we tackle the foundations of the multidimensional setting at different levels, both by looking at the basic exten- sions of the known model and by developing novel algorithms and frameworks for well-understood and useful problems, such as community discovery (our main case study), temporal analysis, link prediction and more.
    [Show full text]
  • Centrality in Modular Networks
    Ghalmane et al. EPJ Data Science (2019)8:15 https://doi.org/10.1140/epjds/s13688-019-0195-7 REGULAR ARTICLE OpenAccess Centrality in modular networks Zakariya Ghalmane1,3, Mohammed El Hassouni1, Chantal Cherifi2 and Hocine Cherifi3* *Correspondence: hocine.cherifi@u-bourgogne.fr Abstract 3LE2I, UMR6306 CNRS, University of Burgundy, Dijon, France Identifying influential nodes in a network is a fundamental issue due to its wide Full list of author information is applications, such as accelerating information diffusion or halting virus spreading. available at the end of the article Many measures based on the network topology have emerged over the years to identify influential nodes such as Betweenness, Closeness, and Eigenvalue centrality. However, although most real-world networks are made of groups of tightly connected nodes which are sparsely connected with the rest of the network in a so-called modular structure, few measures exploit this property. Recent works have shown that it has a significant effect on the dynamics of networks. In a modular network, a node has two types of influence: a local influence (on the nodes of its community) through its intra-community links and a global influence (on the nodes in other communities) through its inter-community links. Depending on the strength of the community structure, these two components are more or less influential. Based on this idea, we propose to extend all the standard centrality measures defined for networks with no community structure to modular networks. The so-called “Modular centrality” is a two-dimensional vector. Its first component quantifies the local influence of a node in its community while the second component quantifies its global influence on the other communities of the network.
    [Show full text]
  • A Network Approach to Define Modularity of Components In
    A Network Approach to Define Modularity of Components Manuel E. Sosa1 Technology and Operations Management Area, in Complex Products INSEAD, 77305 Fontainebleau, France Modularity has been defined at the product and system levels. However, little effort has e-mail: [email protected] gone into defining and quantifying modularity at the component level. We consider com- plex products as a network of components that share technical interfaces (or connections) Steven D. Eppinger in order to function as a whole and define component modularity based on the lack of Sloan School of Management, connectivity among them. Building upon previous work in graph theory and social net- Massachusetts Institute of Technology, work analysis, we define three measures of component modularity based on the notion of Cambridge, Massachusetts 02139 centrality. Our measures consider how components share direct interfaces with adjacent components, how design interfaces may propagate to nonadjacent components in the Craig M. Rowles product, and how components may act as bridges among other components through their Pratt & Whitney Aircraft, interfaces. We calculate and interpret all three measures of component modularity by East Hartford, Connecticut 06108 studying the product architecture of a large commercial aircraft engine. We illustrate the use of these measures to test the impact of modularity on component redesign. Our results show that the relationship between component modularity and component redesign de- pends on the type of interfaces connecting product components. We also discuss direc- tions for future work. ͓DOI: 10.1115/1.2771182͔ 1 Introduction The need to measure modularity has been highlighted implicitly by Saleh ͓12͔ in his recent invitation “to contribute to the growing Previous research on product architecture has defined modular- field of flexibility in system design” ͑p.
    [Show full text]
  • 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]