首页 > 最新文献

Applied Network Science最新文献

英文 中文
American politics in 3D: measuring multidimensional issue alignment in social media using social graphs and text data 三维美国政治:利用社交图谱和文本数据衡量社交媒体中的多维问题一致性
IF 2.2 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2024-01-10 DOI: 10.1007/s41109-023-00608-w
Pedro Ramaciotti, Duncan Cassells, Zografoula Vagena, Jean-Philippe Cointet, Michael Bailey
{"title":"American politics in 3D: measuring multidimensional issue alignment in social media using social graphs and text data","authors":"Pedro Ramaciotti, Duncan Cassells, Zografoula Vagena, Jean-Philippe Cointet, Michael Bailey","doi":"10.1007/s41109-023-00608-w","DOIUrl":"https://doi.org/10.1007/s41109-023-00608-w","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"73 22","pages":""},"PeriodicalIF":2.2,"publicationDate":"2024-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139440546","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 generalized eigenvector centrality for multilayer networks with inter-layer constraints on adjacent node importance. 多层网络的广义特征向量中心性,层间对相邻节点重要性有限制。
IF 2.2 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2024-01-01 Epub Date: 2024-04-30 DOI: 10.1007/s41109-024-00620-8
H Robert Frost

We present a novel approach for computing a variant of eigenvector centrality for multilayer networks with inter-layer constraints on node importance. Specifically, we consider a multilayer network defined by multiple edge-weighted, potentially directed, graphs over the same set of nodes with each graph representing one layer of the network and no inter-layer edges. As in the standard eigenvector centrality construction, the importance of each node in a given layer is based on the weighted sum of the importance of adjacent nodes in that same layer. Unlike standard eigenvector centrality, we assume that the adjacency relationship and the importance of adjacent nodes may be based on distinct layers. Importantly, this type of centrality constraint is only partially supported by existing frameworks for multilayer eigenvector centrality that use edges between nodes in different layers to capture inter-layer dependencies. For our model, constrained, layer-specific eigenvector centrality values are defined by a system of independent eigenvalue problems and dependent pseudo-eigenvalue problems, whose solution can be efficiently realized using an interleaved power iteration algorithm. We refer to this model, and the associated algorithm, as the Constrained Multilayer Centrality (CMLC) method. The characteristics of this approach, and of standard techniques based on inter-layer edges, are demonstrated on both a simple multilayer network and on a range of random graph models. An R package implementing the CMLC method along with example vignettes is available at https://hrfrost.host.dartmouth.edu/CMLC/.

我们提出了一种计算多层网络特征向量中心性变体的新方法,这种网络具有层间节点重要性约束。具体来说,我们考虑的多层网络是由同一节点集上的多个边缘加权、可能有向的图定义的,每个图代表网络的一层,且没有层间边缘。与标准特征向量中心性结构一样,给定层中每个节点的重要性基于同一层中相邻节点重要性的加权和。与标准特征向量中心性不同的是,我们假设相邻节点的邻接关系和重要性可能基于不同的层。重要的是,现有的多层特征向量中心性框架仅部分支持这种类型的中心性约束,这些框架使用不同层中节点之间的边来捕捉层间依赖关系。在我们的模型中,有约束的、特定层的特征向量中心性值是由独立特征值问题和依赖伪特征值问题系统定义的,其解决方案可以通过交错幂迭代算法有效实现。我们将这一模型和相关算法称为约束多层中心性(CMLC)方法。我们在一个简单的多层网络和一系列随机图模型上展示了这种方法的特点,以及基于层间边缘的标准技术的特点。实现 CMLC 方法的 R 软件包和示例可在 https://hrfrost.host.dartmouth.edu/CMLC/ 上获取。
{"title":"A generalized eigenvector centrality for multilayer networks with inter-layer constraints on adjacent node importance.","authors":"H Robert Frost","doi":"10.1007/s41109-024-00620-8","DOIUrl":"10.1007/s41109-024-00620-8","url":null,"abstract":"<p><p>We present a novel approach for computing a variant of eigenvector centrality for multilayer networks with inter-layer constraints on node importance. Specifically, we consider a multilayer network defined by multiple edge-weighted, potentially directed, graphs over the same set of nodes with each graph representing one layer of the network and no inter-layer edges. As in the standard eigenvector centrality construction, the importance of each node in a given layer is based on the weighted sum of the importance of adjacent nodes in that same layer. Unlike standard eigenvector centrality, we assume that the adjacency relationship and the importance of adjacent nodes may be based on distinct layers. Importantly, this type of centrality constraint is only partially supported by existing frameworks for multilayer eigenvector centrality that use edges between nodes in different layers to capture inter-layer dependencies. For our model, constrained, layer-specific eigenvector centrality values are defined by a system of independent eigenvalue problems and dependent pseudo-eigenvalue problems, whose solution can be efficiently realized using an interleaved power iteration algorithm. We refer to this model, and the associated algorithm, as the Constrained Multilayer Centrality (CMLC) method. The characteristics of this approach, and of standard techniques based on inter-layer edges, are demonstrated on both a simple multilayer network and on a range of random graph models. An R package implementing the CMLC method along with example vignettes is available at https://hrfrost.host.dartmouth.edu/CMLC/.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"9 1","pages":"14"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11060970/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140853977","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
Estimating the impact of physician risky-prescribing on the network structure underlying physician shared-patient relationships. 估算医生开具风险处方对医生共享患者关系基础网络结构的影响。
IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2024-01-01 Epub Date: 2024-10-03 DOI: 10.1007/s41109-024-00670-y
Xin Ran, Ellen Meara, Nancy E Morden, Erika L Moen, Daniel N Rockmore, A James O'Malley
<p><p>Social network analysis and shared-patient physician networks have become effective ways of studying physician collaborations. Assortative mixing or "homophily" is the network phenomenon whereby the propensity for similar individuals to form ties is greater than for dissimilar individuals. Motivated by the public health concern of risky-prescribing among older patients in the United States, we develop network models and tests involving novel network measures to study whether there is evidence of homophily in prescribing and deprescribing in the specific shared-patient network of physicians linked to the US state of Ohio in 2014. Evidence of homophily in risky-prescribing would imply that prescribing behaviors help shape physician networks and would suggest strategies for interventions seeking to reduce risky-prescribing (e.g., strategies to directly reduce risky prescribing might be most effective if applied as group interventions to risky prescribing physicians connected through the network and the connections between these physicians could be targeted by tie dissolution interventions as an indirect way of reducing risky prescribing). Furthermore, if such effects varied depending on the structural features of a physician's position in the network (e.g., by whether or not they are involved in cliques-groups of actors that are fully connected to each other-such as closed triangles in the case of three actors), this would further strengthen the case for targeting groups of physicians involved in risky prescribing and the network connections between them for interventions. Using accompanying Medicare Part D data, we converted patient longitudinal prescription receipts into novel measures of the intensity of each physician's risky-prescribing. Exponential random graph models were used to simultaneously estimate the importance of homophily in prescribing and deprescribing in the network beyond the characteristics of physician specialty (or other metadata) and network-derived features. In addition, novel network measures were introduced to allow homophily to be characterized in relation to specific triadic (three-actor) structural configurations in the network with associated non-parametric randomization tests to evaluate their statistical significance in the network against the null hypothesis of no such phenomena. We found physician homophily in prescribing and deprescribing. We also found that physicians exhibited within-triad homophily in risky-prescribing, with the prevalence of homophilic triads significantly higher than expected by chance absent homophily. These results may explain why communities of prescribers emerge and evolve, helping to justify group-level prescriber interventions. The methodology may be applied, adapted or generalized to study homophily and its generalizations on other network and attribute combinations involving analogous shared-patient networks and more generally using other kinds of network data underlying other k
社会网络分析和共享病人的医生网络已成为研究医生合作的有效方法。同类混合(Assortative Mixing)或 "同质性"(homophily)是一种网络现象,即相似个体形成联系的倾向大于不同个体。出于对美国老年患者开具风险处方这一公共卫生问题的关注,我们建立了网络模型,并使用新型网络测量方法进行测试,以研究在 2014 年与美国俄亥俄州相关联的特定医生共享患者网络中,是否存在开具处方和取消处方的同质性证据。风险处方的同质性证据将意味着处方行为有助于形成医生网络,并将为寻求减少风险处方的干预措施提出建议(例如,如果将直接减少风险处方的策略作为群体干预措施应用于通过网络连接的风险处方医生,则可能最为有效,而这些医生之间的联系可以作为减少风险处方的一种间接方式,通过纽带解体干预措施加以解决)。此外,如果这种效果因医生在网络中的位置结构特征而异(例如,根据他们是否参与小团体--彼此完全连接的行为者群体--如三个行为者的封闭三角形),这将进一步加强针对参与风险处方的医生群体以及他们之间的网络连接进行干预的理由。利用随附的医疗保险 D 部分数据,我们将患者的纵向处方收据转换为衡量每位医生风险处方强度的新指标。我们使用指数随机图模型同时估算了医生专业特征(或其他元数据)和网络衍生特征之外,网络中开具处方和取消处方的同质性的重要性。此外,我们还引入了新的网络度量方法,以便根据网络中特定的三元(三因素)结构配置来描述同质性,并进行相关的非参数随机检验,以评估其在网络中的统计意义,并与无此类现象的零假设进行对比。我们发现医生在开处方和取消处方方面具有同质性。我们还发现,医生在开具风险处方时表现出了同族三人组,同族三人组的发生率明显高于不存在同族三人组的偶然性。这些结果可以解释开处方者群体出现和发展的原因,有助于证明群体层面的开处方者干预措施的合理性。该方法可以应用、调整或推广,以研究同质性及其在其他网络和属性组合(涉及类似的共享患者网络)上的普遍性,并更广泛地使用其他类型的网络数据来揭示其他类型的社会现象。
{"title":"Estimating the impact of physician risky-prescribing on the network structure underlying physician shared-patient relationships.","authors":"Xin Ran, Ellen Meara, Nancy E Morden, Erika L Moen, Daniel N Rockmore, A James O'Malley","doi":"10.1007/s41109-024-00670-y","DOIUrl":"10.1007/s41109-024-00670-y","url":null,"abstract":"&lt;p&gt;&lt;p&gt;Social network analysis and shared-patient physician networks have become effective ways of studying physician collaborations. Assortative mixing or \"homophily\" is the network phenomenon whereby the propensity for similar individuals to form ties is greater than for dissimilar individuals. Motivated by the public health concern of risky-prescribing among older patients in the United States, we develop network models and tests involving novel network measures to study whether there is evidence of homophily in prescribing and deprescribing in the specific shared-patient network of physicians linked to the US state of Ohio in 2014. Evidence of homophily in risky-prescribing would imply that prescribing behaviors help shape physician networks and would suggest strategies for interventions seeking to reduce risky-prescribing (e.g., strategies to directly reduce risky prescribing might be most effective if applied as group interventions to risky prescribing physicians connected through the network and the connections between these physicians could be targeted by tie dissolution interventions as an indirect way of reducing risky prescribing). Furthermore, if such effects varied depending on the structural features of a physician's position in the network (e.g., by whether or not they are involved in cliques-groups of actors that are fully connected to each other-such as closed triangles in the case of three actors), this would further strengthen the case for targeting groups of physicians involved in risky prescribing and the network connections between them for interventions. Using accompanying Medicare Part D data, we converted patient longitudinal prescription receipts into novel measures of the intensity of each physician's risky-prescribing. Exponential random graph models were used to simultaneously estimate the importance of homophily in prescribing and deprescribing in the network beyond the characteristics of physician specialty (or other metadata) and network-derived features. In addition, novel network measures were introduced to allow homophily to be characterized in relation to specific triadic (three-actor) structural configurations in the network with associated non-parametric randomization tests to evaluate their statistical significance in the network against the null hypothesis of no such phenomena. We found physician homophily in prescribing and deprescribing. We also found that physicians exhibited within-triad homophily in risky-prescribing, with the prevalence of homophilic triads significantly higher than expected by chance absent homophily. These results may explain why communities of prescribers emerge and evolve, helping to justify group-level prescriber interventions. The methodology may be applied, adapted or generalized to study homophily and its generalizations on other network and attribute combinations involving analogous shared-patient networks and more generally using other kinds of network data underlying other k","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"9 1","pages":"63"},"PeriodicalIF":1.3,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11450072/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142381887","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
Leading by the nodes: a survey of film industry network analysis and datasets. 以节点为主导:电影产业网络分析与数据集调查。
IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2024-01-01 Epub Date: 2024-12-18 DOI: 10.1007/s41109-024-00673-9
Aresh Dadlani, Vi Vo, Ayushi Khemka, Sophie Talalay Harvey, Aigul Kantoro Kyzy, Pete Jones, Deb Verhoeven

This paper presents a comprehensive survey of network analysis research on the film industry, aiming to evaluate its emergence as a field of study and identify potential areas for further research. Many foundational network studies made use of the abundant data from the Internet Movie Database (IMDb) to test network methodologies. This survey focuses more specifically on examining research that employs network analysis to evaluate the film industry itself, revealing the social and business relationships involved in film production, distribution, and consumption. The paper adopts a classification approach based on node type and summarises the key contributions in relation to each. The review provides insights into the structure and interconnectedness of the field, highlighting clusters of debates and shedding light on the areas in need of further theoretical and methodological development. In addition, this survey contributes to understanding film industry network analysis and informs researchers interested in network methods within the film industry and related cultural sectors.

本文对电影产业的网络分析研究进行了全面的综述,旨在评估其作为一个研究领域的出现,并确定进一步研究的潜在领域。许多基础网络研究都利用来自互联网电影数据库(IMDb)的大量数据来检验网络方法。本调查更侧重于研究使用网络分析来评估电影产业本身的研究,揭示电影制作、发行和消费中涉及的社会和商业关系。本文采用了基于节点类型的分类方法,并总结了与每个节点相关的关键贡献。该评论提供了对该领域结构和相互联系的见解,突出了辩论的集群,并阐明了需要进一步理论和方法发展的领域。此外,这项调查有助于理解电影产业网络分析,并为对电影产业和相关文化部门的网络方法感兴趣的研究人员提供信息。
{"title":"Leading by the nodes: a survey of film industry network analysis and datasets.","authors":"Aresh Dadlani, Vi Vo, Ayushi Khemka, Sophie Talalay Harvey, Aigul Kantoro Kyzy, Pete Jones, Deb Verhoeven","doi":"10.1007/s41109-024-00673-9","DOIUrl":"10.1007/s41109-024-00673-9","url":null,"abstract":"<p><p>This paper presents a comprehensive survey of network analysis research on the film industry, aiming to evaluate its emergence as a field of study and identify potential areas for further research. Many foundational network studies made use of the abundant data from the Internet Movie Database (IMDb) to test network methodologies. This survey focuses more specifically on examining research that employs network analysis to evaluate the film industry itself, revealing the social and business relationships involved in film production, distribution, and consumption. The paper adopts a classification approach based on node type and summarises the key contributions in relation to each. The review provides insights into the structure and interconnectedness of the field, highlighting clusters of debates and shedding light on the areas in need of further theoretical and methodological development. In addition, this survey contributes to understanding film industry network analysis and informs researchers interested in network methods within the film industry and related cultural sectors.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"9 1","pages":"76"},"PeriodicalIF":1.3,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11655611/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142877782","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
Approximate inference for longitudinal mechanistic HIV contact network. 纵向机制性艾滋病毒接触网络的近似推断。
IF 2.2 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2024-01-01 Epub Date: 2024-04-30 DOI: 10.1007/s41109-024-00616-4
Octavious Smiley, Till Hoffmann, Jukka-Pekka Onnela

Network models are increasingly used to study infectious disease spread. Exponential Random Graph models have a history in this area, with scalable inference methods now available. An alternative approach uses mechanistic network models. Mechanistic network models directly capture individual behaviors, making them suitable for studying sexually transmitted diseases. Combining mechanistic models with Approximate Bayesian Computation allows flexible modeling using domain-specific interaction rules among agents, avoiding network model oversimplifications. These models are ideal for longitudinal settings as they explicitly incorporate network evolution over time. We implemented a discrete-time version of a previously published continuous-time model of evolving contact networks for men who have sex with men and proposed an ABC-based approximate inference scheme for it. As expected, we found that a two-wave longitudinal study design improves the accuracy of inference compared to a cross-sectional design. However, the gains in precision in collecting data twice, up to 18%, depend on the spacing of the two waves and are sensitive to the choice of summary statistics. In addition to methodological developments, our results inform the design of future longitudinal network studies in sexually transmitted diseases, specifically in terms of what data to collect from participants and when to do so.

网络模型越来越多地被用于研究传染病的传播。指数随机图模型在这一领域有着悠久的历史,目前已有可扩展的推理方法。另一种方法是使用机理网络模型。机理网络模型直接捕捉个体行为,因此适合研究性传播疾病。将机理模型与近似贝叶斯计算相结合,可以利用特定领域的代理之间的交互规则灵活建模,避免网络模型过于简化。这些模型非常适合纵向设置,因为它们明确包含了网络随时间的演变。我们实现了以前发表的男男性行为者接触网络演变连续时间模型的离散时间版本,并提出了基于 ABC 的近似推理方案。不出所料,我们发现与横截面设计相比,两波纵向研究设计提高了推断的准确性。然而,两次数据收集所带来的精确度提升(最高可达 18%)取决于两次波次的间隔,并且对汇总统计量的选择非常敏感。除了方法上的发展,我们的研究结果还为未来性传播疾病纵向网络研究的设计提供了参考,特别是在从参与者那里收集哪些数据以及何时收集数据方面。
{"title":"Approximate inference for longitudinal mechanistic HIV contact network.","authors":"Octavious Smiley, Till Hoffmann, Jukka-Pekka Onnela","doi":"10.1007/s41109-024-00616-4","DOIUrl":"https://doi.org/10.1007/s41109-024-00616-4","url":null,"abstract":"<p><p>Network models are increasingly used to study infectious disease spread. Exponential Random Graph models have a history in this area, with scalable inference methods now available. An alternative approach uses mechanistic network models. Mechanistic network models directly capture individual behaviors, making them suitable for studying sexually transmitted diseases. Combining mechanistic models with Approximate Bayesian Computation allows flexible modeling using domain-specific interaction rules among agents, avoiding network model oversimplifications. These models are ideal for longitudinal settings as they explicitly incorporate network evolution over time. We implemented a discrete-time version of a previously published continuous-time model of evolving contact networks for men who have sex with men and proposed an ABC-based approximate inference scheme for it. As expected, we found that a two-wave longitudinal study design improves the accuracy of inference compared to a cross-sectional design. However, the gains in precision in collecting data twice, up to 18%, depend on the spacing of the two waves and are sensitive to the choice of summary statistics. In addition to methodological developments, our results inform the design of future longitudinal network studies in sexually transmitted diseases, specifically in terms of what data to collect from participants and when to do so.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"9 1","pages":"12"},"PeriodicalIF":2.2,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11060975/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140870121","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
Bayesian hierarchical network autocorrelation models for estimating direct and indirect effects of peer hospitals on outcomes of hospitalized patients. 贝叶斯分层网络自相关模型用于估算同级医院对住院患者预后的直接和间接影响。
IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2024-01-01 Epub Date: 2024-06-14 DOI: 10.1007/s41109-024-00627-1
Guanqing Chen, A James O'Malley

When an hypothesized peer effect (also termed social influence or contagion) is believed to act between units (e.g., hospitals) above the level at which data is observed (e.g., patients), a network autocorrelation model may be embedded within a hierarchical data structure thereby formulating the peer effect as a dependency between latent variables. In such a situation, a patient's own hospital can be thought of as a mediator between the effects of peer hospitals and their outcome. However, as in mediation analyses, there may be interest in allowing the effects of peer units to directly impact patients of other units. To accommodate these possibilities, we develop two hierarchical network autocorrelation models that allow for direct and indirect peer effects between hospitals when modeling individual outcomes of the patients cared for at the hospitals. A Bayesian approach is used for model estimation while a simulation study assesses the performance of the models and sensitivity of results to different prior distributions. We construct a United States New England region patient-sharing hospital network and apply newly developed Bayesian hierarchical models to study the diffusion of robotic surgery and hospital peer effects in patient outcomes using a cohort of United States Medicare beneficiaries in 2016 and 2017. The comparative fit of models to the data is assessed using Deviance information criteria tailored to hierarchical models that include peer effects as latent variables.

Supplementary information: The online version contains supplementary material available at 10.1007/s41109-024-00627-1.

当假设的同伴效应(也称为社会影响或传染)被认为在观察到数据的水平(例如,患者)之上的单位(例如,医院)之间起作用时,可以在分层数据结构中嵌入网络自相关模型,从而将同伴效应表示为潜在变量之间的依赖关系。在这种情况下,患者自己的医院可以被认为是同行医院的影响和他们的结果之间的中介。然而,正如在中介分析中一样,可能有兴趣允许同行单位的影响直接影响其他单位的患者。为了适应这些可能性,我们开发了两个层次网络自相关模型,在对医院照顾的患者的个体结果建模时,允许医院之间的直接和间接对等效应。模型估计采用贝叶斯方法,仿真研究评估了模型的性能和结果对不同先验分布的敏感性。我们构建了一个美国新英格兰地区患者共享医院网络,并应用新开发的贝叶斯分层模型,研究机器人手术的扩散和医院同伴效应对2016年和2017年美国医疗保险受益人的患者结局的影响。模型与数据的比较拟合是使用Deviance信息标准来评估的,该标准是为分层模型量身定制的,其中包括同伴效应作为潜在变量。补充信息:在线版本包含补充资料,提供地址为10.1007/s41109-024-00627-1。
{"title":"Bayesian hierarchical network autocorrelation models for estimating direct and indirect effects of peer hospitals on outcomes of hospitalized patients.","authors":"Guanqing Chen, A James O'Malley","doi":"10.1007/s41109-024-00627-1","DOIUrl":"10.1007/s41109-024-00627-1","url":null,"abstract":"<p><p>When an hypothesized peer effect (also termed social influence or contagion) is believed to act between units (e.g., hospitals) above the level at which data is observed (e.g., patients), a network autocorrelation model may be embedded within a hierarchical data structure thereby formulating the peer effect as a dependency between latent variables. In such a situation, a patient's own hospital can be thought of as a mediator between the effects of peer hospitals and their outcome. However, as in mediation analyses, there may be interest in allowing the effects of peer units to directly impact patients of other units. To accommodate these possibilities, we develop two hierarchical network autocorrelation models that allow for direct and indirect peer effects between hospitals when modeling individual outcomes of the patients cared for at the hospitals. A Bayesian approach is used for model estimation while a simulation study assesses the performance of the models and sensitivity of results to different prior distributions. We construct a United States New England region patient-sharing hospital network and apply newly developed Bayesian hierarchical models to study the diffusion of robotic surgery and hospital peer effects in patient outcomes using a cohort of United States Medicare beneficiaries in 2016 and 2017. The comparative fit of models to the data is assessed using Deviance information criteria tailored to hierarchical models that include peer effects as latent variables.</p><p><strong>Supplementary information: </strong>The online version contains supplementary material available at 10.1007/s41109-024-00627-1.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":"9 1","pages":"24"},"PeriodicalIF":1.3,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11636997/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142819646","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
Network analysis of U.S. non-fatal opioid-involved overdose journeys, 2018-2023. 2018-2023 年美国非致命性阿片类药物过量旅程网络分析。
IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS 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

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.

我们介绍了对美国非致命性阿片类药物过量旅程的全国性网络分析。利用独有的紧急医疗服务事件专有数据集,我们构建了一个从旅程到用药过量的地理空间网络,捕捉了2018-2023年间近50万起阿片类药物过量事件。我们分析了节点(即县或其等同物)的结构和社会学特征,描述了用药过量旅程长度的分布,并调查了 2018 年至 2023 年间旅程网络的变化。我们的研究结果包括,HITS 算法识别出的权威和枢纽节点往往位于城市地区,并涉及地理距离特别长的用药过量旅程。
{"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 Q3 COMPUTER SCIENCE, THEORY & METHODS 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 Q3 COMPUTER SCIENCE, THEORY & METHODS 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 漫画的社会网络分析:与现实社会网络的相似性和几十年来的趋势
Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-11-13 DOI: 10.1007/s41109-023-00604-0
Kashin Sugishita, Naoki Masuda
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.
日本漫画在全球范围内都很受欢迎。角色之间的社交网络,通常被称为角色网络,可能是他们受欢迎的一个重要因素。我们收集了跨度超过70年的162部流行漫画的数据,并分析了它们的角色网络。首先,我们发现角色网络的许多静态和时间属性与真实的人类社交网络相似。其次,大多数漫画的角色网络都是以主角为中心的,这样一个主角就会与大多数其他角色互动。第三,几十年来,主要针对男孩的漫画角色网络已经转向更密集、更少以主角为中心的网络,角色也更少。主要以女孩为对象的漫画除了角色数量呈下降趋势外,呈现出相反的趋势。目前的研究依赖于以前所未有的规模抽样的漫画数据,为进一步的人物网络和漫画其他方面的人口研究铺平了道路。
{"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
期刊
Applied 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