Theories for influencer identification in complex networks

In social and biological systems, the structural heterogeneity of interaction networks gives rise to the emergence of a small set of influential nodes, or influencers, in a series of dynamical processes. Although much smaller than the entire network, these influencers were observed to be able to shape the collective dynamics of large populations in different contexts. As such, the successful identification of influencers should have profound implications in various real-world spreading dynamics such as viral marketing, epidemic outbreaks and cascading failure. In this chapter, we first summarize the centrality-based approach in finding single influencers in complex networks, and then discuss the more complicated problem of locating multiple influencers from a collective point of view. Progress rooted in collective influence theory, belief-propagation and computer science will be presented. Finally, we present some applications of influencer identification in diverse real-world systems, including online social platforms, scientific publication, brain networks and socioeconomic systems.Comment: 24 pages, 6 figure

Which Sectors of a Modern Economy are most Central?

We analyze input-output matrices for a wide set of countries as weighted directed networks. These graphs contain only 47 nodes, but they are almost fully connected and many have nodes with strong self-loops. We apply two measures: random walk centrality and one based on count-betweenness. Our findings are intuitive. For example, in Luxembourg the most central sector is “Finance and Insurance” and the analog in Germany is “Wholesale and Retail Trade” or “Motor Vehicles”, according to the measure. Rankings of sectoral centrality vary by country. Some sectors are often highly central, while others never are. Hierarchical clustering reveals geographical proximity and similar development status.

Nodes having a major influence to break cooperation define a novel centrality measure

Cooperation played a significant role in the self-organization and evolution of living organisms. Both network topology and the initial position of cooperators heavily affect the cooperation of social dilemma games. We developed a novel simulation program package, called 'NetworGame', which is able to simulate any type of social dilemma games on any model, or real world networks with any assignment of initial cooperation or defection strategies to network nodes. The ability of initially defecting single nodes to break overall cooperation was called as 'game centrality'. The efficiency of this measure was verified on well-known social networks, and was extended to 'protein games', i.e. the simulation of cooperation between proteins, or their amino acids. Hubs and in particular, party hubs of yeast protein-protein interaction networks had a large influence to convert the cooperation of other nodes to defection. Simulations on methionyl-tRNA synthetase protein structure network indicated an increased influence of nodes belonging to intra-protein signaling pathways on breaking cooperation. The efficiency of single, initially defecting nodes to convert the cooperation of other nodes to defection in social dilemma games may be an important measure to predict the importance of nodes in the integration and regulation of complex systems. Game centrality may help to design more efficient interventions to cellular networks (in forms of drugs), to ecosystems and social networks. The NetworGame algorithm is downloadable from here: www.NetworGame.linkgroup.huComment: 18 pages, 2 figures, 3 Tables + a supplement containing 8 pages, 1 figure, 2 Tables and the pseudo-code of the algorithm, the NetworGame algorithm is downloadable from here: http://www.NetworGame.linkgroup.h

Peer Effects and Social Networks in Education and Crime

This paper studies whether structural properties of friendship networks affect individual outcomes in education and crime. We first develop a model that shows that, at the Nash equilibrium, the outcome of each individual embedded in a network is proportional to her Bonacich centrality measure. This measure takes into account both direct and indirect friends of each individual but puts less weight to her distant friends. Using a very detailed dataset of adolescent friendship networks, we show that, after controlling for observable individual characteristics and unobservable network specific factors, the individual's position in a network (as measured by her Bonacich centrality) is a key determinant of her level of activity. A standard deviation increase in the Bonocich centrality increases the level of individual delinquency by 45% of one standard deviation and the pupil school performance by 34% of one standard deviation.Centrality Measure; Peer Influence; Network Structure; Delinquency; School Performance

Normative pathways in the functional connectome.

Functional connectivity is frequently derived from fMRI data to reduce a complex image of the brain to a graph, or "functional connectome". Often shortest-path algorithms are used to characterize and compare functional connectomes. Previous work on the identification and measurement of semi-metric (shortest circuitous) pathways in the functional connectome has discovered cross-sectional differences in major depressive disorder (MDD), autism spectrum disorder (ASD), and Alzheimer's disease. However, while measurements of shortest path length have been analyzed in functional connectomes, less work has been done to investigate the composition of the pathways themselves, or whether the edges composing pathways differ between individuals. Developments in this area would help us understand how pathways might be organized in mental disorders, and if a consistent pattern can be found. Furthermore, studies in structural brain connectivity and other real-world graphs suggest that shortest pathways may not be as important in functional connectivity studies as previously assumed. In light of this, we present a novel measurement of the consistency of pathways across functional connectomes, and an algorithm for improvement by selecting the most frequently occurring "normative pathways" from the k shortest paths, instead of just the shortest path. We also look at this algorithm's effect on various graph measurements, using randomized matrix simulations to support the efficacy of this method and demonstrate our algorithm on the resting-state fMRI (rs-fMRI) of a group of 34 adolescent control participants. Additionally, a comparison of normative pathways is made with a group of 82 age-matched participants, diagnosed with MDD, and in doing so we find the normative pathways that are most disrupted. Our results, which are carried out with estimates of connectivity derived from correlation, partial correlation, and normalized mutual information connectomes, suggest disruption to the default mode, affective, and ventral attention networks. Normative pathways, especially with partial correlation, make greater use of critical anatomical pathways through the striatum, cingulum, and the cerebellum. In summary, MDD is characterized by a disruption of normative pathways of the ventral attention network, increases in alternative pathways in the frontoparietal network in MDD, and a mixture of both in the default mode network. Additionally, within- and between-groups findings depend on the estimate of connectivity.UK Medical Research Council (grant: G0802226) National Institute for Health Research (NIHR) (grant: 06-05-01) Alzheimer’s Research UK (ARUK- SRF2017B-1) Gates Cambridge Scholarshi

Attributed Stream Hypergraphs: temporal modeling of node-attributed high-order interactions

Recent advances in network science have resulted in two distinct research directions aimed at augmenting and enhancing representations for complex networks. The first direction, that of high-order modeling, aims to focus on connectivity between sets of nodes rather than pairs, whereas the second one, that of feature-rich augmentation, incorporates into a network all those elements that are driven by information which is external to the structure, like node properties or the flow of time. This paper proposes a novel toolbox, that of Attributed Stream Hypergraphs (ASHs), unifying both high-order and feature-rich elements for representing, mining, and analyzing complex networks. Applied to social network analysis, ASHs can characterize complex social phenomena along topological, dynamic and attributive elements. Experiments on real-world face-to-face and online social media interactions highlight that ASHs can easily allow for the analyses, among others, of high-order groups' homophily, nodes' homophily with respect to the hyperedges in which nodes participate, and time-respecting paths between hyperedges.Comment: Submitted to "Applied Network Science