Applied Network Science最新文献

筛选
英文 中文
Network analysis of U.S. non-fatal opioid-involved overdose journeys, 2018-2023. 2018-2023 年美国非致命性阿片类药物过量旅程网络分析。
IF 1.3
Applied Network Science Pub Date : 2024-01-01 Epub Date: 2024-11-11 DOI: 10.1007/s41109-024-00661-z
Lucas H McCabe, Naoki Masuda, Shannon Casillas, Nathan Danneman, Alen Alic, Royal Law
{"title":"Network analysis of U.S. non-fatal opioid-involved overdose journeys, 2018-2023.","authors":"Lucas H McCabe, Naoki Masuda, Shannon Casillas, Nathan Danneman, Alen Alic, Royal Law","doi":"10.1007/s41109-024-00661-z","DOIUrl":"10.1007/s41109-024-00661-z","url":null,"abstract":"<p><p>We present a nation-wide network analysis of non-fatal opioid-involved overdose journeys in the United States. Leveraging a unique proprietary dataset of Emergency Medical Services incidents, we construct a journey-to-overdose geospatial network capturing nearly half a million opioid-involved overdose events spanning 2018-2023. We analyze the structure and sociological profiles of the nodes, which are counties or their equivalents, characterize the distribution of overdose journey lengths, and investigate changes in the journey network between 2018 and 2023. Our findings include that authority and hub nodes identified by the HITS algorithm tend to be located in urban areas and involved in overdose journeys with particularly long geographical distances.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"9 1","pages":"68"},"PeriodicalIF":1.3,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11554813/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142629240","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
Coarsening effects on k-partite network classification K 部分网络分类的粗化效应
IF 2.2
Applied Network Science Pub Date : 2023-12-01 DOI: 10.1007/s41109-023-00606-y
Paulo Eduardo Althoff, Alan Demétrius Baria Valejo, Thiago de Paulo Faleiros
{"title":"Coarsening effects on k-partite network classification","authors":"Paulo Eduardo Althoff, Alan Demétrius Baria Valejo, Thiago de Paulo Faleiros","doi":"10.1007/s41109-023-00606-y","DOIUrl":"https://doi.org/10.1007/s41109-023-00606-y","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"109 3","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138621630","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 novel regularized weighted estimation method for information diffusion prediction in social networks 用于社交网络信息扩散预测的新型正则化加权估算方法
IF 2.2
Applied Network Science Pub Date : 2023-11-30 DOI: 10.1007/s41109-023-00605-z
Yoosof Mashayekhi, Alireza Rezvanian, S. M. Vahidipour
{"title":"A novel regularized weighted estimation method for information diffusion prediction in social networks","authors":"Yoosof Mashayekhi, Alireza Rezvanian, S. M. Vahidipour","doi":"10.1007/s41109-023-00605-z","DOIUrl":"https://doi.org/10.1007/s41109-023-00605-z","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"88 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2023-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139198137","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
Social network analysis of manga: similarities to real-world social networks and trends over decades 漫画的社会网络分析:与现实社会网络的相似性和几十年来的趋势
Applied Network Science Pub Date : 2023-11-13 DOI: 10.1007/s41109-023-00604-0
Kashin Sugishita, Naoki Masuda
{"title":"Social network analysis of manga: similarities to real-world social networks and trends over decades","authors":"Kashin Sugishita, Naoki Masuda","doi":"10.1007/s41109-023-00604-0","DOIUrl":"https://doi.org/10.1007/s41109-023-00604-0","url":null,"abstract":"Abstract Manga, Japanese comics, has been popular on a global scale. Social networks among characters, which are often called character networks, may be a significant contributor to their popularity. We collected data from 162 popular manga that span over 70 years and analyzed their character networks. First, we found that many of static and temporal properties of the character networks are similar to those of real human social networks. Second, the character networks of most manga are protagonist-centered such that a single protagonist interacts with the majority of other characters. Third, the character networks for manga mainly targeting boys have shifted to denser and less protagonist-centered networks and with fewer characters over decades. Manga mainly targeting girls showed the opposite trend except for the downward trend in the number of characters. The present study, which relies on manga data sampled on an unprecedented scale, paves the way for further population studies of character networks and other aspects of comics.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"4 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136282281","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
Investigating the effect of selective exposure, audience fragmentation, and echo-chambers on polarization in dynamic media ecosystems 研究动态媒体生态系统中选择性曝光、受众碎片化和回声室对极化的影响
Applied Network Science Pub Date : 2023-11-09 DOI: 10.1007/s41109-023-00601-3
Nicholas Rabb, Lenore Cowen, Jan P. de Ruiter
{"title":"Investigating the effect of selective exposure, audience fragmentation, and echo-chambers on polarization in dynamic media ecosystems","authors":"Nicholas Rabb, Lenore Cowen, Jan P. de Ruiter","doi":"10.1007/s41109-023-00601-3","DOIUrl":"https://doi.org/10.1007/s41109-023-00601-3","url":null,"abstract":"Abstract The degree of polarization in many societies has become a pressing concern in media studies. Typically, it is argued that the internet and social media have created more media producers than ever before, allowing individual, biased media consumers to expose themselves only to what already confirms their beliefs, leading to polarized echo-chambers that further deepen polarization. This work introduces extensions to the recent Cognitive Cascades model of Rabb et al. to study this dynamic, allowing for simulation of information spread between media and networks of variably biased citizens. Our results partially confirm the above polarization logic, but also reveal several important enabling conditions for polarization to occur: (1) the distribution of media belief must be more polarized than the population; (2) the population must be at least somewhat persuadable to changing their belief according to new messages they hear; and finally, (3) the media must statically continue to broadcast more polarized messages rather than, say, adjust to appeal more to the beliefs of their current subscribers. Moreover, and somewhat counter-intuitively, under these conditions we find that polarization is more likely to occur when media consumers are exposed to more diverse messages, and that polarization occurred most often when there were low levels of echo-chambers and fragmentation. These results suggest that polarization is not simply due to biased individuals responding to an influx of media sources in the digital age, but also a consequence of polarized media conditions within an information ecosystem that supports more diverse exposure than is typically thought.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":" 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135291145","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
From co-location patterns to an informal social network of gig economy workers 从共同办公模式到零工经济工作者的非正式社会网络
Applied Network Science Pub Date : 2023-11-09 DOI: 10.1007/s41109-023-00603-1
Gustavo Pilatti, Cristian Candia, Alessandra Montini, Flávio L. Pinheiro
{"title":"From co-location patterns to an informal social network of gig economy workers","authors":"Gustavo Pilatti, Cristian Candia, Alessandra Montini, Flávio L. Pinheiro","doi":"10.1007/s41109-023-00603-1","DOIUrl":"https://doi.org/10.1007/s41109-023-00603-1","url":null,"abstract":"Abstract The labor market has transformed with the advent of the gig economy, characterized by short-term and flexible work arrangements facilitated by online platforms. As this trend becomes increasingly prevalent, it presents unique opportunities and challenges. In this manuscript, we comprehensively characterize the social networks of gig economy workers in each of the 15 cities studied. Our analysis reveals a scaling relationship between networks and the city population. In particular, we note the high level of modularity of the networks, and we argue that it results from the natural specialization of couriers along different areas of the cities. Furthermore, we show that degree and betweenness centrality is positively correlated with income but not with tenure. Our findings shed new light on the social organization of the gig economy workers and provide valuable insights for the management and design of gig economy platforms.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":" 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135243034","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 Twitter network and discourse analysis of the Rana Plaza collapse 拉纳广场倒塌的推特网络与话语分析
Applied Network Science Pub Date : 2023-11-07 DOI: 10.1007/s41109-023-00587-y
Kai Bergermann, Margitta Wolter
{"title":"A Twitter network and discourse analysis of the Rana Plaza collapse","authors":"Kai Bergermann, Margitta Wolter","doi":"10.1007/s41109-023-00587-y","DOIUrl":"https://doi.org/10.1007/s41109-023-00587-y","url":null,"abstract":"Abstract Ten years after the collapse of the Rana Plaza textile factory in Dhaka, Bangladesh that killed over 1000 factory workers, the event has become a symbol for the desolate working conditions in fast fashion producer countries in the global south. We analyze the global Twitter discourse on this event over a three week window around the collapse date over the years 2013–2022 by a mixture of network-theoretic quantitative and discourse-theoretic qualitative methods. In particular, key communicators and the community structure of the discourse participants are identified using a multilayer network modeling approach and the interpretative patterns of the key communicator’s tweets of all years are analyzed using the sociology of knowledge approach to discourse. This combination of quantitative and qualitative methods reveals that the discourse is separated into three phases: reporting, reprocessing, and commemoration. These phases can be identified by the temporal evolution, network-structural properties, and the contentual analysis of the discourse. After the negotiation of the interpretative framework in the reprocessing phase, subsequent years are characterized by its commemorative repetition as well as resulting demands by different international actor groups despite highly fluctuating participants.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"94 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135480546","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
Short- and long-term temporal network prediction based on network memory 基于网络记忆的短期和长期网络预测
Applied Network Science Pub Date : 2023-11-07 DOI: 10.1007/s41109-023-00597-w
Li Zou, Alberto Ceria, Huijuan Wang
{"title":"Short- and long-term temporal network prediction based on network memory","authors":"Li Zou, Alberto Ceria, Huijuan Wang","doi":"10.1007/s41109-023-00597-w","DOIUrl":"https://doi.org/10.1007/s41109-023-00597-w","url":null,"abstract":"Abstract Temporal networks are networks whose topology changes over time. Two nodes in a temporal network are connected at a discrete time step only if they have a contact/interaction at that time. The classic temporal network prediction problem aims to predict the temporal network one time step ahead based on the network observed in the past of a given duration. This problem has been addressed mostly via machine learning algorithms, at the expense of high computational costs and limited interpretation of the underlying mechanisms that form the networks. Hence, we propose to predict the connection of each node pair one step ahead based on the connections of this node pair itself and of node pairs that share a common node with this target node pair in the past. The concrete design of our two prediction models is based on the analysis of the memory property of real-world physical networks, i.e., to what extent two snapshots of a network at different times are similar in topology (or overlap). State-of-the-art prediction methods that allow interpretation are considered as baseline models. In seven real-world physical contact networks, our methods are shown to outperform the baselines in both prediction accuracy and computational complexity. They perform better in networks with stronger memory. Importantly, our models reveal how the connections of different types of node pairs in the past contribute to the connection estimation of a target node pair. Predicting temporal networks like physical contact networks in the long-term future beyond short-term i.e., one step ahead is crucial to forecast and mitigate the spread of epidemics and misinformation on the network. This long-term prediction problem has been seldom explored. Therefore, we propose basic methods that adapt each aforementioned prediction model to address classic short-term network prediction problem for long-term network prediction task. The prediction quality of all adapted models is evaluated via the accuracy in predicting each network snapshot and in reproducing key network properties. The prediction based on one of our models tends to have the highest accuracy and lowest computational complexity.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135433014","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
Semisupervised regression in latent structure networks on unknown manifolds 未知流形上潜在结构网络的半监督回归
Applied Network Science Pub Date : 2023-11-07 DOI: 10.1007/s41109-023-00598-9
Aranyak Acharyya, Joshua Agterberg, Michael W. Trosset, Youngser Park, Carey E. Priebe
{"title":"Semisupervised regression in latent structure networks on unknown manifolds","authors":"Aranyak Acharyya, Joshua Agterberg, Michael W. Trosset, Youngser Park, Carey E. Priebe","doi":"10.1007/s41109-023-00598-9","DOIUrl":"https://doi.org/10.1007/s41109-023-00598-9","url":null,"abstract":"Abstract Random graphs are increasingly becoming objects of interest for modeling networks in a wide range of applications. Latent position random graph models posit that each node is associated with a latent position vector, and that these vectors follow some geometric structure in the latent space. In this paper, we consider random dot product graphs, in which an edge is formed between two nodes with probability given by the inner product of their respective latent positions. We assume that the latent position vectors lie on an unknown one-dimensional curve and are coupled with a response covariate via a regression model. Using the geometry of the underlying latent position vectors, we propose a manifold learning and graph embedding technique to predict the response variable on out-of-sample nodes, and we establish convergence guarantees for these responses. Our theoretical results are supported by simulations and an application to Drosophila brain data.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"6 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135480184","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
Decentralizing the lightning network: a score-based recommendation strategy for the autopilot system 去中心化闪电网络:自动驾驶系统的基于分数的推荐策略
Applied Network Science Pub Date : 2023-10-30 DOI: 10.1007/s41109-023-00602-2
Mohammad Saleh Mahdizadeh, Behnam Bahrak, Mohammad Sayad Haghighi
{"title":"Decentralizing the lightning network: a score-based recommendation strategy for the autopilot system","authors":"Mohammad Saleh Mahdizadeh, Behnam Bahrak, Mohammad Sayad Haghighi","doi":"10.1007/s41109-023-00602-2","DOIUrl":"https://doi.org/10.1007/s41109-023-00602-2","url":null,"abstract":"Abstract The fundamental objective of the Lightning Network is to establish a decentralized platform for scaling the Bitcoin network and facilitating high-throughput micropayments. However, this network has gradually deviated from its decentralized topology since its operational inception, and its resources have quickly shifted towards centralization. The evolution of the network and the changes in its topology have been critically reviewed and criticized due to its increasing centralization. This study delves into the network’s topology and the reasons behind its centralized evolution. We explain the incentives of various participating nodes in the network and propose a score-based strategy for the Lightning Autopilot system, which is responsible for automatically establishing new payment channels for the nodes joining the network. Our study demonstrates that utilizing the proposed strategy could significantly aid in reducing the network’s centralization. This strategy is grounded in qualitative labeling of network nodes based on topological and protocol features, followed by the creation of a scoring and recommendation model. Results of the experiments indicate that in the evolved network using the proposed strategy, concentration indicators such as the Gini coefficient can decrease by up to 17%, and channels ownership of the top 1% of hubs decrease by 27% compared to other autopilot strategies. Moreover, through simulated targeted attacks on hubs and channels, it is shown that by adopting the proposed strategy, the network’s resilience is increased compared to the existing autopilot strategies for evolved networks. The proposed method from this research can also be integrated into operational Lightning clients and potentially replace the current recommendation methods used in Lightning Autopilot.","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136022602","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
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学术文献互助群
群 号:604180095
Book学术官方微信