发布求助
文献互助 智能选刊 最新文献

Network Science最新文献

筛选
英文 中文
NWS volume 9 issue 4 Cover and Front matter NWS第9卷第4期封面和封面
IF 1.7
Network Science Pub Date : 2021-12-01 DOI: 10.1017/nws.2022.3
{"title":"NWS volume 9 issue 4 Cover and Front matter","authors":"","doi":"10.1017/nws.2022.3","DOIUrl":"https://doi.org/10.1017/nws.2022.3","url":null,"abstract":"","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49560428","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 9 issue 4 Cover and Back matter NWS第9卷第4期封面和封底
IF 1.7
Network Science Pub Date : 2021-12-01 DOI: 10.1017/nws.2022.4
{"title":"NWS volume 9 issue 4 Cover and Back matter","authors":"","doi":"10.1017/nws.2022.4","DOIUrl":"https://doi.org/10.1017/nws.2022.4","url":null,"abstract":"","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49573107","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
Toward a generalized notion of discrete time for modeling temporal networks 对离散时间的广义概念建模的时间网络
IF 1.7
Network Science Pub Date : 2021-12-01 DOI: 10.1017/nws.2021.20
Konstantin Kueffner, Mark Strembeck
{"title":"Toward a generalized notion of discrete time for modeling temporal networks","authors":"Konstantin Kueffner, Mark Strembeck","doi":"10.1017/nws.2021.20","DOIUrl":"https://doi.org/10.1017/nws.2021.20","url":null,"abstract":"Abstract Many real-world networks, including social networks and computer networks for example, are temporal networks. This means that the vertices and edges change over time. However, most approaches for modeling and analyzing temporal networks do not explicitly discuss the underlying notion of time. In this paper, we therefore introduce a generalized notion of discrete time for modeling temporal networks. Our approach also allows for considering nondeterministic time and incomplete data, two issues that are often found when analyzing datasets extracted from online social networks, for example. In order to demonstrate the consequences of our generalized notion of time, we also discuss the implications for the computation of (shortest) temporal paths in temporal networks. In addition, we implemented an R-package that provides programming support for all concepts discussed in this paper. The R-package is publicly available for download.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43885061","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
A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs 一个用于比较无向图和有向图嵌入的多用途无监督框架
IF 1.7
Network Science Pub Date : 2021-11-30 DOI: 10.1017/nws.2022.27
Bogumil Kami'nski, Ł. Kraiński, P. Prałat, F. Théberge
{"title":"A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs","authors":"Bogumil Kami'nski, Ł. Kraiński, P. Prałat, F. Théberge","doi":"10.1017/nws.2022.27","DOIUrl":"https://doi.org/10.1017/nws.2022.27","url":null,"abstract":"Abstract Graph embedding is a transformation of nodes of a network into a set of vectors. A good embedding should capture the underlying graph topology and structure, node-to-node relationship, and other relevant information about the graph, its subgraphs, and nodes themselves. If these objectives are achieved, an embedding is a meaningful, understandable, and often compressed representation of a network. Unfortunately, selecting the best embedding is a challenging task and very often requires domain experts. In this paper, we extend the framework for evaluating graph embeddings that was recently introduced in [15]. Now, the framework assigns two scores, local and global, to each embedding that measure the quality of an evaluated embedding for tasks that require good representation of local and, respectively, global properties of the network. The best embedding, if needed, can be selected in an unsupervised way, or the framework can identify a few embeddings that are worth further investigation. The framework is flexible and scalable and can deal with undirected/directed and weighted/unweighted graphs.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45004872","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}
引用次数: 5
NWS volume 9 issue S1 Cover and Front matter 美国国家气象局第9卷第S1期封面和封面
IF 1.7
Network Science Pub Date : 2021-10-01 DOI: 10.1017/nws.2021.13
{"title":"NWS volume 9 issue S1 Cover and Front matter","authors":"","doi":"10.1017/nws.2021.13","DOIUrl":"https://doi.org/10.1017/nws.2021.13","url":null,"abstract":"","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45151151","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 9 issue S1 Cover and Back matter NWS第九卷第S1期封面和封底
IF 1.7
Network Science Pub Date : 2021-09-08 DOI: 10.1017/nws.2021.14
xutong liu
{"title":"NWS volume 9 issue S1 Cover and Back matter","authors":"xutong liu","doi":"10.1017/nws.2021.14","DOIUrl":"https://doi.org/10.1017/nws.2021.14","url":null,"abstract":"original Articles Gradient and Harnack-type estimates for PageRank paul horn and lauren m. nelsen S4 Learning to count: A deep learning framework for graphlet count estimation xutong liu, yu-zhen janice chen, john c. s. lui and konstantin avrachenkov S23 On the impact of network size and average degree on the robustness of centrality measures christoph martin and peter niemeyer S61 Isolation concepts applied to temporal clique enumeration hendrik molter, rolf niedermeier and malte renken S83 A simple differential geometry for complex networks emil saucan, areejit samal and jürgen jost S106 Sampling methods and estimation of triangle count distributions in large networks nelson antunes, tianjian guo and vladas pipiras S134 Logic and learning in network cascades galen j.wilkerson and sotiris moschoyiannis S157 network science editorial team","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42426152","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 9 issue 3 Cover and Back matter NWS第9卷第3期封面和封底
IF 1.7
Network Science Pub Date : 2021-09-01 DOI: 10.1017/nws.2021.16
{"title":"NWS volume 9 issue 3 Cover and Back matter","authors":"","doi":"10.1017/nws.2021.16","DOIUrl":"https://doi.org/10.1017/nws.2021.16","url":null,"abstract":"original Articles Robust coordination in adversarial social networks: From human behavior to agent-based modeling chen hajaj, zlatko joveski, sixie yu and yevgeniy vorobeychik 255 Separable and semiparametric network-based counting processes applied to the international combat aircraft trades cornelius fritz, paul w. thurner and göran kauermann 291 Efficient Laplacian spectral density computations for networks with arbitrary degree distributions grover e. c. guzman, peter f. stadler and andré fujita 312 Diffusion profile embedding as a basis for graph vertex similarity scott payne, edgar fuller, george spirou and cun-quan zhang 328 Investigating scientific mobility in co-authorship networks using multilayer temporal motifs hanjo d. boekhout, vincent a. traag and frank w. takes 354 network science editorial team","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44899246","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
Efficient Laplacian spectral density computations for networks with arbitrary degree distributions 任意度分布网络的高效拉普拉斯谱密度计算
IF 1.7
Network Science Pub Date : 2021-09-01 DOI: 10.1017/nws.2021.10
Grover E. C. Guzman, P. Stadler, André Fujita
{"title":"Efficient Laplacian spectral density computations for networks with arbitrary degree distributions","authors":"Grover E. C. Guzman, P. Stadler, André Fujita","doi":"10.1017/nws.2021.10","DOIUrl":"https://doi.org/10.1017/nws.2021.10","url":null,"abstract":"Abstract The network Laplacian spectral density calculation is critical in many fields, including physics, chemistry, statistics, and mathematics. It is highly computationally intensive, limiting the analysis to small networks. Therefore, we present two efficient alternatives: one based on the network’s edges and another on the degrees. The former gives the exact spectral density of locally tree-like networks but requires iterative edge-based message-passing equations. In contrast, the latter obtains an approximation of the spectral density using only the degree distribution. The computational complexities are 𝒪(|E|log(n)) and 𝒪(n), respectively, in contrast to 𝒪(n3) of the diagonalization method, where n is the number of vertices and |E| is the number of edges.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45288613","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}
引用次数: 2
Investigating scientific mobility in co-authorship networks using multilayer temporal motifs 使用多层时间基序研究合著者网络中的科学流动性
IF 1.7
Network Science Pub Date : 2021-09-01 DOI: 10.1017/nws.2021.12
Hanjo D. Boekhout, V. Traag, F. Takes
{"title":"Investigating scientific mobility in co-authorship networks using multilayer temporal motifs","authors":"Hanjo D. Boekhout, V. Traag, F. Takes","doi":"10.1017/nws.2021.12","DOIUrl":"https://doi.org/10.1017/nws.2021.12","url":null,"abstract":"Abstract This paper introduces a framework for understanding complex temporal interaction patterns in large-scale scientific collaboration networks. In particular, we investigate how two key concepts in science studies, scientific collaboration and scientific mobility, are related and possibly differ between fields. We do so by analyzing multilayer temporal motifs: small recurring configurations of nodes and edges. Driven by the problem that many papers share the same publication year, we first provide a methodological contribution: an efficient counting algorithm for multilayer temporal motifs with concurrent edges. Next, we introduce a systematic categorization of the multilayer temporal motifs, such that each category reflects a pattern of behavior relevant to scientific collaboration and mobility. Here, a key question concerns the causal direction: does mobility lead to collaboration or vice versa? Applying this framework to scientific collaboration networks extracted from Web of Science (WoS) consisting of up to 7.7 million nodes (authors) and 94 million edges (collaborations), we find that international collaboration and international mobility reciprocally influence one another. Additionally, we find that Social sciences & Humanities (SSH) scholars co-author to a greater extent with authors at a distance, while Mathematics & Computer science (M&C) scholars tend to continue to collaborate within the established knowledge network and organization.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49362697","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}
引用次数: 2
Diffusion profile embedding as a basis for graph vertex similarity 扩散轮廓嵌入作为图顶点相似度的基础
IF 1.7
Network Science Pub Date : 2021-09-01 DOI: 10.1017/nws.2021.11
Scott Payne, Edgar Fuller, G. Spirou, Cun-Quan Zhang
{"title":"Diffusion profile embedding as a basis for graph vertex similarity","authors":"Scott Payne, Edgar Fuller, G. Spirou, Cun-Quan Zhang","doi":"10.1017/nws.2021.11","DOIUrl":"https://doi.org/10.1017/nws.2021.11","url":null,"abstract":"Abstract We describe here a notion of diffusion similarity, a method for defining similarity between vertices in a given graph using the properties of random walks on the graph to model the relationships between vertices. Using the approach of graph vertex embedding, we characterize a vertex vi by considering two types of diffusion patterns: the ways in which random walks emanate from the vertex vi to the remaining graph and how they converge to the vertex vi from the graph. We define the similarity of two vertices vi and vj as the average of the cosine similarity of the vectors characterizing vi and vj. We obtain these vectors by modifying the solution to a differential equation describing a type of continuous time random walk. This method can be applied to any dataset that can be assigned a graph structure that is weighted or unweighted, directed or undirected. It can be used to represent similarity of vertices within community structures of a network while at the same time representing similarity of vertices within layered substructures (e.g., bipartite subgraphs) of the network. To validate the performance of our method, we apply it to synthetic data as well as the neural connectome of the C. elegans worm and a connectome of neurons in the mouse retina. A tool developed to characterize the accuracy of the similarity values in detecting community structures, the uncertainty index, is introduced in this paper as a measure of the quality of similarity methods.","PeriodicalId":51827,"journal":{"name":"Network Science","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47920926","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信