首页 > 最新文献

Network Science最新文献

英文 中文
Understanding collaboration patterns on funded research projects: A network analysis 理解资助研究项目的合作模式:网络分析
IF 1.7 Q2 Social Sciences Pub Date : 2022-11-23 DOI: 10.1017/nws.2022.33
Matthew Smith, Y. Sarabi, D. Christopoulos
Abstract This paper provides an examination of inter-organizational collaboration in the UK research system. Data are collected on organizational collaboration on projects funded by four key UK research councils: Arts and Humanities Research Council, Economic and Social Research Council, Engineering and Physical Sciences Research Council, and Biotechnology and Biological Sciences Research Council. The organizational partnerships include both academic and nonacademic institutions. A collaboration network is created for each research council, and an exponential random graph model is applied to inform on the mechanisms underpinning collaborative tie formation on research council-funded projects. We find that in the sciences, collaborative patterns are much more hierarchical and concentrated in a small handful of actors compared to the social sciences and humanities projects. Institutions that are members of the elite Russell Group (a set of 24 high-ranking UK universities) are much more likely to be involved in collaborations across research councils.
摘要本文对英国研究系统中的组织间合作进行了考察。数据收集于由四个主要英国研究委员会资助的项目的组织合作:艺术与人文研究委员会、经济与社会研究委员会、工程与物理科学研究委员会以及生物技术与生物科学研究委员会。组织伙伴关系包括学术和非学术机构。为每个研究委员会创建了一个协作网络,并应用指数随机图模型来了解支持研究委员会资助项目的协作关系形成的机制。我们发现,与社会科学和人文学科项目相比,在科学领域,合作模式更加分层,集中在少数参与者身上。精英罗素集团(由24所英国高级大学组成)的成员机构更有可能参与跨研究委员会的合作。
{"title":"Understanding collaboration patterns on funded research projects: A network analysis","authors":"Matthew Smith, Y. Sarabi, D. Christopoulos","doi":"10.1017/nws.2022.33","DOIUrl":"https://doi.org/10.1017/nws.2022.33","url":null,"abstract":"Abstract This paper provides an examination of inter-organizational collaboration in the UK research system. Data are collected on organizational collaboration on projects funded by four key UK research councils: Arts and Humanities Research Council, Economic and Social Research Council, Engineering and Physical Sciences Research Council, and Biotechnology and Biological Sciences Research Council. The organizational partnerships include both academic and nonacademic institutions. A collaboration network is created for each research council, and an exponential random graph model is applied to inform on the mechanisms underpinning collaborative tie formation on research council-funded projects. We find that in the sciences, collaborative patterns are much more hierarchical and concentrated in a small handful of actors compared to the social sciences and humanities projects. Institutions that are members of the elite Russell Group (a set of 24 high-ranking UK universities) are much more likely to be involved in collaborations across research councils.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2022-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46637987","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
Random networks grown by fusing edges via urns 随机网络通过urn融合边缘
IF 1.7 Q2 Social Sciences Pub Date : 2022-11-03 DOI: 10.1017/nws.2022.30
K. R. Bhutani, Ravi Kalpathy, H. Mahmoud
Abstract Many classic networks grow by hooking small components via vertices. We introduce a class of networks that grows by fusing the edges of a small graph to an edge chosen uniformly at random from the network. For this random edge-hooking network, we study the local degree profile, that is, the evolution of the average degree of a vertex over time. For a special subclass, we further determine the exact distribution and an asymptotic gamma-type distribution. We also study the “core,” which consists of the well-anchored edges that experience fusing. A central limit theorem emerges for the size of the core. At the end, we look at an alternative model of randomness attained by preferential hooking, favoring edges that experience more fusing. Under preferential hooking, the core still follows a Gaussian law but with different parameters. Throughout, Pólya urns are systematically used as a method of proof.
许多经典网络是通过将小的组件通过顶点连接起来而增长的。我们引入了一类网络,它通过将一个小图的边融合到从网络中随机均匀选择的边来生长。对于这种随机钩边网络,我们研究了其局部度分布,即顶点的平均度随时间的演化。对于一个特殊的子类,我们进一步确定了精确分布和渐近γ型分布。我们还研究了“核心”,它由经历融合的锚定良好的边缘组成。核心大小的中心极限定理出现了。最后,我们看一看通过优先挂钩获得的另一种随机性模型,倾向于经历更多融合的边。在优先挂钩下,核心仍然遵循高斯定律,但参数有所不同。自始至终,Pólya骨灰盒被系统地用作一种证明方法。
{"title":"Random networks grown by fusing edges via urns","authors":"K. R. Bhutani, Ravi Kalpathy, H. Mahmoud","doi":"10.1017/nws.2022.30","DOIUrl":"https://doi.org/10.1017/nws.2022.30","url":null,"abstract":"Abstract Many classic networks grow by hooking small components via vertices. We introduce a class of networks that grows by fusing the edges of a small graph to an edge chosen uniformly at random from the network. For this random edge-hooking network, we study the local degree profile, that is, the evolution of the average degree of a vertex over time. For a special subclass, we further determine the exact distribution and an asymptotic gamma-type distribution. We also study the “core,” which consists of the well-anchored edges that experience fusing. A central limit theorem emerges for the size of the core. At the end, we look at an alternative model of randomness attained by preferential hooking, favoring edges that experience more fusing. Under preferential hooking, the core still follows a Gaussian law but with different parameters. Throughout, Pólya urns are systematically used as a method of proof.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2022-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42059853","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}
引用次数: 4
Network Science: 7th International Winter Conference, NetSci-X 2022, Porto, Portugal, February 8–11, 2022, Proceedings 网络科学:第七届国际冬季会议,NetSci-X 2022,波尔图,葡萄牙,2022年2月8-11日,会议录
IF 1.7 Q2 Social Sciences Pub Date : 2022-10-21 DOI: 10.1007/978-3-030-97240-0
Carlos Andre Reis Pinheiro
{"title":"Network Science: 7th International Winter Conference, NetSci-X 2022, Porto, Portugal, February 8–11, 2022, Proceedings","authors":"Carlos Andre Reis Pinheiro","doi":"10.1007/978-3-030-97240-0","DOIUrl":"https://doi.org/10.1007/978-3-030-97240-0","url":null,"abstract":"","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80880082","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
How teams adapt to exogenous shocks: Experimental evidence with node knockouts of central members 团队如何适应外部冲击:核心成员节点敲除的实验证据
IF 1.7 Q2 Social Sciences Pub Date : 2022-09-01 DOI: 10.1017/nws.2022.26
Jared F. Edgerton, S. Cranmer, V. Finomore
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.
摘要研究人员发现,尽管外部攻击、外部冲击和节点敲除可以破坏网络系统,但它们很少导致系统崩溃。尽管这些过程被广泛理解,但大多数关于外部冲击如何影响网络的研究都依赖于模拟或观测数据。因此,人们对真实的个体群体如何应对外部攻击知之甚少。在这篇文章中,我们采用了一种实验设计,以意外移除队友的形式,将外源性冲击强加给相互认识的小组。这使我们能够因果地确定被移除的个人对团队结构的贡献,个人对他们所联系的人的影响,以及节点淘汰对团队的影响。在团队层面,我们发现节点淘汰会降低团队内部的整体沟通。在个人层面上,我们发现节点淘汰会导致剩余的有影响力的球员变得更有影响力,而剩余的外围球员在团队中变得更加孤立。此外,我们还发现节点淘汰赛可能对团队表现有名义上的影响。这些发现揭示了团队如何应对和适应节点淘汰。
{"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":null,"pages":null},"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 Q2 Social Sciences Pub Date : 2022-09-01 DOI: 10.1017/nws.2022.25
Azwirman Gusrialdi
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.
摘要本文考虑了一个强连接有向网络中的链路移除问题,其目标是在保持网络的强连通性的同时最小化网络邻接矩阵的优势特征值。由于问题的复杂性,本文着重于计算次优解决方案。此外,假设不具备整个网络拓扑的知识。这需要分布式算法,该算法仅依赖于每个单独节点可用的本地信息以及每个节点与其相邻节点之间的信息交换。提出了基于矩阵摄动分析的两种不同的链路移除策略,即同步移除策略和迭代移除策略。实现这两种策略的关键因素包括用于估计邻接矩阵的主要特征向量的新型分布式算法,以及用于验证链路移除下有向网络的强连通性。通过对不同类型网络的数值模拟表明,迭代链路移除策略通常产生较好的次优解。然而,与同时删除链路策略相比,它的通信成本更高。
{"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":null,"pages":null},"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
Strong and weak tie homophily in adolescent friendship networks: An analysis of same-race and same-gender ties. 青少年友谊网络中的强弱关系同质性:同种族和同性关系的分析。
IF 1.7 Q2 Social Sciences Pub Date : 2022-09-01 DOI: 10.1017/nws.2022.24
Cassie McMillan

While we know that adolescents tend to befriend peers who share their race and gender, it is unclear whether patterns of homophily vary according to the strength, intimacy, or connectedness of these relationships. By applying valued exponential random graph models to a sample of 153 adolescent friendship networks, I test whether tendencies towards same-race and same-gender friendships differ for strong versus weak relational ties. In nondiverse, primarily white networks, weak ties are more likely to connect same-race peers, while racial homophily is not associated with the formation of stronger friendships. As racial diversity increases, however, strong ties become more likely to connect same-race peers, while weaker bonds are less apt to be defined by racial homophily. Gender homophily defines the patterns of all friendship ties, but these tendencies are more pronounced for weaker connections. My results highlight the empirical value of considering tie strength when examining social processes in adolescent networks.

虽然我们知道青少年倾向于与种族和性别相同的同龄人交朋友,但尚不清楚同性关系的模式是否会因这些关系的强度、亲密度或连通性而有所不同。通过将有价值的指数随机图模型应用到153个青少年友谊网络样本中,我测试了同性和同性友谊的倾向是否会因强弱关系关系而有所不同。在非多样化的,主要是白人的网络中,弱关系更有可能将同种族的同伴联系起来,而种族同一性与更牢固的友谊的形成无关。然而,随着种族多样性的增加,牢固的纽带更有可能将同种族的同伴联系起来,而较弱的纽带则不太可能由种族同一性来定义。性别同一性定义了所有友谊关系的模式,但这种趋势在较弱的联系中更为明显。我的研究结果强调了在考察青少年网络中的社会过程时考虑纽带强度的经验价值。
{"title":"Strong and weak tie homophily in adolescent friendship networks: An analysis of same-race and same-gender ties.","authors":"Cassie McMillan","doi":"10.1017/nws.2022.24","DOIUrl":"https://doi.org/10.1017/nws.2022.24","url":null,"abstract":"<p><p>While we know that adolescents tend to befriend peers who share their race and gender, it is unclear whether patterns of homophily vary according to the strength, intimacy, or connectedness of these relationships. By applying valued exponential random graph models to a sample of 153 adolescent friendship networks, I test whether tendencies towards same-race and same-gender friendships differ for strong versus weak relational ties. In nondiverse, primarily white networks, weak ties are more likely to connect same-race peers, while racial homophily is not associated with the formation of stronger friendships. As racial diversity increases, however, strong ties become more likely to connect same-race peers, while weaker bonds are less apt to be defined by racial homophily. Gender homophily defines the patterns of all friendship ties, but these tendencies are more pronounced for weaker connections. My results highlight the empirical value of considering tie strength when examining social processes in adolescent networks.</p>","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10104515/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9323175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
NWS volume 10 issue 3 Cover and Front matter NWS第10卷第3期封面和封面
IF 1.7 Q2 Social Sciences Pub Date : 2022-09-01 DOI: 10.1017/nws.2022.28
{"title":"NWS volume 10 issue 3 Cover and Front matter","authors":"","doi":"10.1017/nws.2022.28","DOIUrl":"https://doi.org/10.1017/nws.2022.28","url":null,"abstract":"","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47372707","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
Techniques for blocking the propagation of two simultaneous contagions over networks using a graph dynamical systems framework 利用图动态系统框架阻止两种同时传染在网络上传播的技术
IF 1.7 Q2 Social Sciences Pub Date : 2022-08-30 DOI: 10.1017/nws.2022.18
Henry L. Carscadden, C. Kuhlman, M. Marathe, Sujith Ravi, D. Rosenkrantz
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.
摘要我们考虑两种传染病在社交网络上同时传播。我们假设两种传染病传播的阈值模型,并使用离散动力系统的形式框架。特别是,我们研究了一个优化问题,其中的目标是在传染病可用疫苗总数的预算限制下,最大限度地减少新感染的总数。虽然文献中对单一传染病考虑了这个问题,但我们的工作考虑了两种传染病的同时传播。这个优化问题是NP难的。我们提出了该问题的两种主要求解方法,即获得最优解的整数线性规划(ILP)公式和基于集覆盖问题的推广的启发式算法。我们使用许多真实世界的网络对我们的解决方案方法进行了全面的实验评估。实验结果表明,我们的启发式算法产生了接近最优解的解,并且比基于ILP的方法更快地运行几个数量级来获得最优解。我们还对启发式算法进行了敏感性研究。
{"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":null,"pages":null},"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
Generating weighted and thresholded gene coexpression networks using signed distance correlation. 使用符号距离相关生成加权和阈值基因共表达网络。
IF 1.7 Q2 Social Sciences Pub Date : 2022-06-01 Epub Date: 2022-06-16 DOI: 10.1017/nws.2022.13
Javier Pardo-Diaz, Philip S Poole, Mariano Beguerisse-Díaz, Charlotte M Deane, Gesine Reinert

Even within well-studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes or proteins, using a network of gene coexpression data that includes functional annotations. Signed distance correlation has proved useful for the construction of unweighted gene coexpression networks. However, transforming correlation values into unweighted networks may lead to a loss of important biological information related to the intensity of the correlation. Here we introduce a principled method to construct weighted gene coexpression networks using signed distance correlation. These networks contain weighted edges only between those pairs of genes whose correlation value is higher than a given threshold. We analyse data from different organisms and find that networks generated with our method based on signed distance correlation are more stable and capture more biological information compared to networks obtained from Pearson correlation. Moreover, we show that signed distance correlation networks capture more biological information than unweighted networks based on the same metric. While we use biological data sets to illustrate the method, the approach is general and can be used to construct networks in other domains. Code and data are available on https://github.com/javier-pardodiaz/sdcorGCN.

即使在经过充分研究的生物体中,许多基因也缺乏有用的功能注释。生成这种功能信息的一种方法是使用包含功能注释的基因共表达数据网络来推断基因或蛋白质之间的生物学关系。符号距离相关已被证明对构建非加权基因共表达网络是有用的。然而,将相关值转换为未加权的网络可能会导致丢失与相关强度相关的重要生物信息。本文介绍了一种利用符号距离相关构建加权基因共表达网络的基本方法。这些网络只包含那些相关值高于给定阈值的基因对之间的加权边。我们分析了来自不同生物的数据,发现与Pearson相关获得的网络相比,基于符号距离相关的方法生成的网络更稳定,捕获了更多的生物信息。此外,我们证明了基于相同度量的带符号距离相关网络比未加权网络捕获更多的生物信息。虽然我们使用生物数据集来说明该方法,但该方法是通用的,可以用于构建其他领域的网络。代码和数据可在https://github.com/javier-pardodiaz/sdcorGCN上获得。
{"title":"Generating weighted and thresholded gene coexpression networks using signed distance correlation.","authors":"Javier Pardo-Diaz,&nbsp;Philip S Poole,&nbsp;Mariano Beguerisse-Díaz,&nbsp;Charlotte M Deane,&nbsp;Gesine Reinert","doi":"10.1017/nws.2022.13","DOIUrl":"https://doi.org/10.1017/nws.2022.13","url":null,"abstract":"<p><p>Even within well-studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes or proteins, using a network of gene coexpression data that includes functional annotations. Signed distance correlation has proved useful for the construction of unweighted gene coexpression networks. However, transforming correlation values into unweighted networks may lead to a loss of important biological information related to the intensity of the correlation. Here we introduce a principled method to construct <i>weighted</i> gene coexpression networks using signed distance correlation. These networks contain weighted edges only between those pairs of genes whose correlation value is higher than a given threshold. We analyse data from different organisms and find that networks generated with our method based on signed distance correlation are more stable and capture more biological information compared to networks obtained from Pearson correlation. Moreover, we show that signed distance correlation networks capture more biological information than unweighted networks based on the same metric. While we use biological data sets to illustrate the method, the approach is general and can be used to construct networks in other domains. Code and data are available on https://github.com/javier-pardodiaz/sdcorGCN.</p>","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7613200/pdf/EMS145046.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"33520477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","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 Q2 Social Sciences Pub Date : 2022-06-01 DOI: 10.1017/nws.2022.21
{"title":"NWS volume 10 issue 2 Cover and Front matter","authors":"","doi":"10.1017/nws.2022.21","DOIUrl":"https://doi.org/10.1017/nws.2022.21","url":null,"abstract":"","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44988542","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
期刊
Network Science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1