Network Science最新文献_第4页

How teams adapt to exogenous shocks: Experimental evidence with node knockouts of central members 团队如何适应外部冲击：核心成员节点敲除的实验证据

IF 1.7

Network Science Pub Date : 2022-09-01 DOI: 10.1017/nws.2022.26

Jared F. Edgerton, S. Cranmer, V. Finomore

{"title":"How teams adapt to exogenous shocks: Experimental evidence with node knockouts of central members","authors":"Jared F. Edgerton, S. Cranmer, V. Finomore","doi":"10.1017/nws.2022.26","DOIUrl":"https://doi.org/10.1017/nws.2022.26","url":null,"abstract":"Abstract Researchers have found that although external attacks, exogenous shocks, and node knockouts can disrupt networked systems, they rarely lead to the system’s collapse. Although these processes are widely understood, most studies of how exogenous shocks affect networks rely on simulated or observational data. Thus, little is known about how groups of real individuals respond to external attacks. In this article, we employ an experimental design in which exogenous shocks, in the form of the unexpected removal of a teammate, are imposed on small teams of people who know each other. This allows us to causally identify the removed individual’s contribution to the team structure, the effect that an individual had on those they were connected, and the effect of the node knockout on the team. At the team level, we find that node knockouts decrease overall internal team communication. At the individual level, we find that node knockouts cause the remaining influential players to become more influential, while the remaining peripheral players become more isolated within their team. In addition, we also find that node knockouts may have a nominal influence on team performance. These findings shed light on how teams respond and adapt to node knockouts.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"10 1","pages":"261 - 282"},"PeriodicalIF":1.7,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42460808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Connectivity-preserving distributed algorithms for removing links in directed networks 有向网络中去除链路的保连通分布式算法

IF 1.7

Network Science Pub Date : 2022-09-01 DOI: 10.1017/nws.2022.25

Azwirman Gusrialdi

{"title":"Connectivity-preserving distributed algorithms for removing links in directed networks","authors":"Azwirman Gusrialdi","doi":"10.1017/nws.2022.25","DOIUrl":"https://doi.org/10.1017/nws.2022.25","url":null,"abstract":"Abstract This article considers the link removal problem in a strongly connected directed network with the goal of minimizing the dominant eigenvalue of the network’s adjacency matrix while maintaining its strong connectivity. Due to the complexity of the problem, this article focuses on computing a suboptimal solution. Furthermore, it is assumed that the knowledge of the overall network topology is not available. This calls for distributed algorithms which rely solely on the local information available to each individual node and information exchange between each node and its neighbors. Two different strategies based on matrix perturbation analysis are presented, namely simultaneous and iterative link removal strategies. Key ingredients in implementing both strategies include novel distributed algorithms for estimating the dominant eigenvectors of an adjacency matrix and for verifying strong connectivity of a directed network under link removal. It is shown via numerical simulations on different type of networks that in general the iterative link removal strategy yields a better suboptimal solution. However, it comes at a price of higher communication cost in comparison to the simultaneous link removal strategy.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"10 1","pages":"215 - 233"},"PeriodicalIF":1.7,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48193587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

NWS volume 10 issue 3 Cover and Front matter NWS第10卷第3期封面和封面

IF 1.7

Network Science Pub Date : 2022-09-01 DOI: 10.1017/nws.2022.28

引用次数: 0

Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework 利用图动态系统框架阻止两种同时传染在网络上传播的技术

IF 1.7

Network Science Pub Date : 2022-08-30 DOI: 10.1017/nws.2022.18

Henry L. Carscadden, C. Kuhlman, M. Marathe, Sujith Ravi, D. Rosenkrantz

{"title":"Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework","authors":"Henry L. Carscadden, C. Kuhlman, M. Marathe, Sujith Ravi, D. Rosenkrantz","doi":"10.1017/nws.2022.18","DOIUrl":"https://doi.org/10.1017/nws.2022.18","url":null,"abstract":"Abstract We consider the simultaneous propagation of two contagions over a social network. We assume a threshold model for the propagation of the two contagions and use the formal framework of discrete dynamical systems. In particular, we study an optimization problem where the goal is to minimize the total number of new infections subject to a budget constraint on the total number of available vaccinations for the contagions. While this problem has been considered in the literature for a single contagion, our work considers the simultaneous propagation of two contagions. This optimization problem is NP-hard. We present two main solution approaches for the problem, namely an integer linear programming (ILP) formulation to obtain optimal solutions and a heuristic based on a generalization of the set cover problem. We carry out a comprehensive experimental evaluation of our solution approaches using many real-world networks. The experimental results show that our heuristic algorithm produces solutions that are close to the optimal solution and runs several orders of magnitude faster than the ILP-based approach for obtaining optimal solutions. We also carry out sensitivity studies of our heuristic algorithm.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"10 1","pages":"234 - 260"},"PeriodicalIF":1.7,"publicationDate":"2022-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42880008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

NWS volume 10 issue 2 Cover and Front matter NWS第10卷第2期封面和封面

IF 1.7

Network Science Pub Date : 2022-06-01 DOI: 10.1017/nws.2022.21

引用次数: 0

Consensus embedding for multiple networks: Computation and applications 多网络共识嵌入:计算与应用

IF 1.7

Network Science Pub Date : 2022-05-30 DOI: 10.1017/nws.2022.17

Mengzhen Li, Mustafa Coşkun, Mehmet Koyutürk

{"title":"Consensus embedding for multiple networks: Computation and applications","authors":"Mengzhen Li, Mustafa Coşkun, Mehmet Koyutürk","doi":"10.1017/nws.2022.17","DOIUrl":"https://doi.org/10.1017/nws.2022.17","url":null,"abstract":"Abstract Machine learning applications on large-scale network-structured data commonly encode network information in the form of node embeddings. Network embedding algorithms map the nodes into a low-dimensional space such that the nodes that are “similar” with respect to network topology are also close to each other in the embedding space. Real-world networks often have multiple versions or can be “multiplex” with multiple types of edges with different semantics. For such networks, computation of Consensus Embeddings based on the node embeddings of individual versions can be useful for various reasons, including privacy, efficiency, and effectiveness of analyses. Here, we systematically investigate the performance of three dimensionality reduction methods in computing consensus embeddings on networks with multiple versions: singular value decomposition, variational auto-encoders, and canonical correlation analysis (CCA). Our results show that (i) CCA outperforms other dimensionality reduction methods in computing concensus embeddings, (ii) in the context of link prediction, consensus embeddings can be used to make predictions with accuracy close to that provided by embeddings of integrated networks, and (iii) consensus embeddings can be used to improve the efficiency of combinatorial link prediction queries on multiple networks by multiple orders of magnitude.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":"10 1","pages":"190 - 206"},"PeriodicalIF":1.7,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42375078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

A hierarchical latent space network model for mediation 一种用于中介的分层潜在空间网络模型

IF 1.7

Network Science Pub Date : 2022-05-30 DOI: 10.1017/nws.2022.12

T. Sweet, S. Adhikari

引用次数: 2

Bringing network science to primary school 将网络科学引入小学

IF 1.7

Network Science Pub Date : 2022-05-30 DOI: 10.1017/nws.2022.15

C. Stegehuis

引用次数: 0

The duality of networks and groups: Models to generate two-mode networks from one-mode networks 网络和群体的二元性:从单模网络生成双模网络的模型