Pub Date : 2024-01-10DOI: 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}
Pub Date : 2024-01-01Epub Date: 2024-04-30DOI: 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}
Pub Date : 2024-01-01Epub Date: 2024-10-03DOI: 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":"<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","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}
Pub Date : 2024-01-01Epub Date: 2024-12-18DOI: 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.
{"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}
Pub Date : 2024-01-01Epub Date: 2024-04-30DOI: 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.
{"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}
Pub Date : 2024-01-01Epub Date: 2024-06-14DOI: 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.
{"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}
Pub Date : 2024-01-01Epub Date: 2024-11-11DOI: 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.
{"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}
Pub Date : 2023-12-01DOI: 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}
Pub Date : 2023-11-30DOI: 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}
Pub Date : 2023-11-13DOI: 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.
{"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}