首页 > 最新文献

Applied Network Science最新文献

英文 中文
Parameterizing network graph heterogeneity using a modified Weibull distribution. 使用改进的威布尔分布参数化网络图的异质性。
IF 2.2 Q1 Multidisciplinary Pub Date : 2023-01-01 DOI: 10.1007/s41109-023-00544-9
Sinan A Ozbay, Maximilian M Nguyen

We present a simple method to quantitatively capture the heterogeneity in the degree distribution of a network graph using a single parameter σ . Using an exponential transformation of the shape parameter of the Weibull distribution, this control parameter allows the degree distribution to be easily interpolated between highly symmetric and highly heterogeneous distributions on the unit interval. This parameterization of heterogeneity also recovers several other canonical distributions as intermediate special cases, including the Gaussian, Rayleigh, and exponential distributions. We then outline a general graph generation algorithm to produce graphs with a desired amount of heterogeneity. The utility of this formulation of a heterogeneity parameter is demonstrated with examples relating to epidemiological modeling and spectral analysis.

我们提出了一种简单的方法,用单个参数σ来定量地捕捉网络图度分布的异质性。利用威布尔分布形状参数的指数变换,该控制参数允许在单位区间上的高度对称分布和高度非均匀分布之间容易地插值度分布。异质性的参数化也恢复了其他几种典型分布作为中间的特殊情况,包括高斯分布、瑞利分布和指数分布。然后,我们概述了一种通用的图形生成算法,以生成具有所需异质性的图形。通过与流行病学建模和光谱分析有关的例子,证明了这种异质性参数公式的实用性。
{"title":"Parameterizing network graph heterogeneity using a modified Weibull distribution.","authors":"Sinan A Ozbay,&nbsp;Maximilian M Nguyen","doi":"10.1007/s41109-023-00544-9","DOIUrl":"https://doi.org/10.1007/s41109-023-00544-9","url":null,"abstract":"<p><p>We present a simple method to quantitatively capture the heterogeneity in the degree distribution of a network graph using a single parameter <math><mi>σ</mi></math> . Using an exponential transformation of the shape parameter of the Weibull distribution, this control parameter allows the degree distribution to be easily interpolated between highly symmetric and highly heterogeneous distributions on the unit interval. This parameterization of heterogeneity also recovers several other canonical distributions as intermediate special cases, including the Gaussian, Rayleigh, and exponential distributions. We then outline a general graph generation algorithm to produce graphs with a desired amount of heterogeneity. The utility of this formulation of a heterogeneity parameter is demonstrated with examples relating to epidemiological modeling and spectral analysis.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10144902/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9784643","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}
引用次数: 3
Impact of network centrality and income on slowing infection spread after outbreaks. 网络中心性和收入对疫情后减缓感染传播的影响。
IF 2.2 Q1 Multidisciplinary Pub Date : 2023-01-01 DOI: 10.1007/s41109-023-00540-z
Shiv G Yücel, Rafael H M Pereira, Pedro S Peixoto, Chico Q Camargo

The COVID-19 pandemic has shed light on how the spread of infectious diseases worldwide are importantly shaped by both human mobility networks and socio-economic factors. However, few studies look at how both socio-economic conditions and the complex network properties of human mobility patterns interact, and how they influence outbreaks together. We introduce a novel methodology, called the Infection Delay Model, to calculate how the arrival time of an infection varies geographically, considering both effective distance-based metrics and differences in regions' capacity to isolate-a feature associated with socio-economic inequalities. To illustrate an application of the Infection Delay Model, this paper integrates household travel survey data with cell phone mobility data from the São Paulo metropolitan region to assess the effectiveness of lockdowns to slow the spread of COVID-19. Rather than operating under the assumption that the next pandemic will begin in the same region as the last, the model estimates infection delays under every possible outbreak scenario, allowing for generalizable insights into the effectiveness of interventions to delay a region's first case. The model sheds light on how the effectiveness of lockdowns to slow the spread of disease is influenced by the interaction of mobility networks and socio-economic levels. We find that a negative relationship emerges between network centrality and the infection delay after a lockdown, irrespective of income. Furthermore, for regions across all income and centrality levels, outbreaks starting in less central locations were more effectively slowed by a lockdown. Using the Infection Delay Model, this paper identifies and quantifies a new dimension of disease risk faced by those most central in a mobility network.

2019冠状病毒病大流行揭示了人类流动网络和社会经济因素如何在很大程度上影响全球传染病的传播。然而,很少有研究着眼于社会经济条件和人类流动模式的复杂网络特性如何相互作用,以及它们如何共同影响疫情。我们引入了一种新的方法,称为感染延迟模型,来计算感染的到达时间在地理上是如何变化的,同时考虑了基于距离的有效度量和区域隔离能力的差异——这是与社会经济不平等相关的特征。为了说明感染延迟模型的应用,本文将家庭旅行调查数据与来自圣保罗大都会地区的手机移动数据相结合,以评估封锁对减缓COVID-19传播的有效性。该模型不是假设下一次大流行将在上一次大流行的同一地区开始,而是在每一种可能的爆发情景下估计感染延迟,从而可以对延迟一个地区第一例病例的干预措施的有效性进行概括性的了解。该模型揭示了封锁减缓疾病传播的有效性如何受到流动网络和社会经济水平相互作用的影响。我们发现,与收入无关,封锁后的网络中心性与感染延迟之间存在负相关关系。此外,对于所有收入和中心性水平的地区,从中心位置较低的地区开始的疫情通过封锁得到了更有效的减缓。利用感染延迟模型,本文确定并量化了移动网络中最核心人群所面临的疾病风险的新维度。
{"title":"Impact of network centrality and income on slowing infection spread after outbreaks.","authors":"Shiv G Yücel,&nbsp;Rafael H M Pereira,&nbsp;Pedro S Peixoto,&nbsp;Chico Q Camargo","doi":"10.1007/s41109-023-00540-z","DOIUrl":"https://doi.org/10.1007/s41109-023-00540-z","url":null,"abstract":"<p><p>The COVID-19 pandemic has shed light on how the spread of infectious diseases worldwide are importantly shaped by both human mobility networks and socio-economic factors. However, few studies look at how both socio-economic conditions and the complex network properties of human mobility patterns interact, and how they influence outbreaks together. We introduce a novel methodology, called the Infection Delay Model, to calculate how the arrival time of an infection varies geographically, considering both effective distance-based metrics and differences in regions' capacity to isolate-a feature associated with socio-economic inequalities. To illustrate an application of the Infection Delay Model, this paper integrates household travel survey data with cell phone mobility data from the São Paulo metropolitan region to assess the effectiveness of lockdowns to slow the spread of COVID-19. Rather than operating under the assumption that the next pandemic will begin in the same region as the last, the model estimates infection delays under every possible outbreak scenario, allowing for generalizable insights into the effectiveness of interventions to delay a region's first case. The model sheds light on how the effectiveness of lockdowns to slow the spread of disease is influenced by the interaction of mobility networks and socio-economic levels. We find that a negative relationship emerges between network centrality and the infection delay after a lockdown, irrespective of income. Furthermore, for regions across all income and centrality levels, outbreaks starting in less central locations were more effectively slowed by a lockdown. Using the Infection Delay Model, this paper identifies and quantifies a new dimension of disease risk faced by those most central in a mobility network.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9951146/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10872656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The persistent homology of genealogical networks. 宗谱网络的持久同源性。
IF 2.2 Q1 Multidisciplinary Pub Date : 2023-01-01 DOI: 10.1007/s41109-023-00538-7
Zachary M Boyd, Nick Callor, Taylor Gledhill, Abigail Jenkins, Robert Snellman, Benjamin Webb, Raelynn Wonnacott

Genealogical networks (i.e. family trees) are of growing interest, with the largest known data sets now including well over one billion individuals. Interest in family history also supports an 8.5 billion dollar industry whose size is projected to double within 7 years [FutureWise report HC-1137]. Yet little mathematical attention has been paid to the complex network properties of genealogical networks, especially at large scales. The structure of genealogical networks is of particular interest due to the practice of forming unions, e.g. marriages, that are typically well outside one's immediate family. In most other networks, including other social networks, no equivalent restriction exists on the distance at which relationships form. To study the effect this has on genealogical networks we use persistent homology to identify and compare the structure of 101 genealogical and 31 other social networks. Specifically, we introduce the notion of a network's persistence curve, which encodes the network's set of persistence intervals. We find that the persistence curves of genealogical networks have a distinct structure when compared to other social networks. This difference in structure also extends to subnetworks of genealogical and social networks suggesting that, even with incomplete data, persistent homology can be used to meaningfully analyze genealogical networks. Here we also describe how concepts from genealogical networks, such as common ancestor cycles, are represented using persistent homology. We expect that persistent homology tools will become increasingly important in genealogical exploration as popular interest in ancestry research continues to expand.

家谱网络(即家谱)日益引起人们的兴趣,目前已知的最大数据集包括远远超过10亿个人。对家族史的兴趣也支持了一个85亿美元的产业,其规模预计将在7年内翻一番[FutureWise报告HC-1137]。然而,很少有数学关注谱系网络的复杂网络特性,特别是在大尺度上。家谱网络的结构特别令人感兴趣,因为形成联盟的实践,例如婚姻,通常是在一个人的直系亲属之外。在大多数其他网络中,包括其他社交网络,对关系形成的距离没有相应的限制。为了研究这对系谱网络的影响,我们使用持久同源性来识别和比较101个系谱网络和31个其他社会网络的结构。具体来说,我们引入了网络持久曲线的概念,它对网络的持久间隔集进行编码。我们发现,与其他社会网络相比,家谱网络的持续曲线具有明显的结构。这种结构上的差异也延伸到系谱和社会网络的子网络,这表明,即使数据不完整,持久的同源性也可以用于有意义的系谱网络分析。在这里,我们还描述了如何使用持久同源性来表示来自系谱网络的概念,例如共同祖先循环。我们预计,随着人们对祖先研究的兴趣不断扩大,持久的同源工具将在家谱探索中变得越来越重要。
{"title":"The persistent homology of genealogical networks.","authors":"Zachary M Boyd,&nbsp;Nick Callor,&nbsp;Taylor Gledhill,&nbsp;Abigail Jenkins,&nbsp;Robert Snellman,&nbsp;Benjamin Webb,&nbsp;Raelynn Wonnacott","doi":"10.1007/s41109-023-00538-7","DOIUrl":"https://doi.org/10.1007/s41109-023-00538-7","url":null,"abstract":"<p><p>Genealogical networks (i.e. family trees) are of growing interest, with the largest known data sets now including well over one billion individuals. Interest in family history also supports an 8.5 billion dollar industry whose size is projected to double within 7 years [FutureWise report HC-1137]. Yet little mathematical attention has been paid to the complex network properties of genealogical networks, especially at large scales. The structure of genealogical networks is of particular interest due to the practice of forming unions, e.g. marriages, that are typically well outside one's immediate family. In most other networks, including other social networks, no equivalent restriction exists on the distance at which relationships form. To study the effect this has on genealogical networks we use persistent homology to identify and compare the structure of 101 genealogical and 31 other social networks. Specifically, we introduce the notion of a network's persistence curve, which encodes the network's set of persistence intervals. We find that the persistence curves of genealogical networks have a distinct structure when compared to other social networks. This difference in structure also extends to subnetworks of genealogical and social networks suggesting that, even with incomplete data, persistent homology can be used to meaningfully analyze genealogical networks. Here we also describe how concepts from genealogical networks, such as common ancestor cycles, are represented using persistent homology. We expect that persistent homology tools will become increasingly important in genealogical exploration as popular interest in ancestry research continues to expand.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9950181/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9353129","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 embedding aided vaccine skepticism detection. 网络嵌入辅助疫苗怀疑性检测。
IF 1.3 Q3 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-01-01 Epub Date: 2023-02-16 DOI: 10.1007/s41109-023-00534-x
Ferenc Béres, Tamás Vilmos Michaletzky, Rita Csoma, András A Benczúr

We investigate automatic methods to assess COVID vaccination views in Twitter content. Vaccine skepticism has been a controversial topic of long history that has become more important than ever with the COVID-19 pandemic. Our main goal is to demonstrate the importance of network effects in detecting vaccination skeptic content. Towards this end, we collected and manually labeled vaccination-related Twitter content in the first half of 2021. Our experiments confirm that the network carries information that can be exploited to improve the accuracy of classifying attitudes towards vaccination over content classification as baseline. We evaluate a variety of network embedding algorithms, which we combine with text embedding to obtain classifiers for vaccination skeptic content. In our experiments, by using Walklets, we improve the AUC of the best classifier with no network information by. We publicly release our labels, Tweet IDs and source codes on GitHub.

我们研究了自动评估 Twitter 内容中 COVID 疫苗接种观点的方法。疫苗怀疑论是一个历史悠久的争议性话题,随着 COVID-19 的流行,它变得比以往任何时候都更加重要。我们的主要目标是证明网络效应在检测疫苗接种怀疑论内容方面的重要性。为此,我们收集了 2021 年上半年与疫苗接种相关的 Twitter 内容,并对其进行了人工标注。我们的实验证实,与内容分类相比,网络携带的信息可用于提高疫苗接种态度分类的准确性。我们评估了各种网络嵌入算法,并将其与文本嵌入相结合,从而获得疫苗接种怀疑论内容的分类器。在我们的实验中,通过使用 Walklets,我们提高了无网络信息的最佳分类器的 AUC。我们在 GitHub 上公开发布我们的标签、Tweet ID 和源代码。
{"title":"Network embedding aided vaccine skepticism detection.","authors":"Ferenc Béres, Tamás Vilmos Michaletzky, Rita Csoma, András A Benczúr","doi":"10.1007/s41109-023-00534-x","DOIUrl":"10.1007/s41109-023-00534-x","url":null,"abstract":"<p><p>We investigate automatic methods to assess COVID vaccination views in Twitter content. Vaccine skepticism has been a controversial topic of long history that has become more important than ever with the COVID-19 pandemic. Our main goal is to demonstrate the importance of network effects in detecting vaccination skeptic content. Towards this end, we collected and manually labeled vaccination-related Twitter content in the first half of 2021. Our experiments confirm that the network carries information that can be exploited to improve the accuracy of classifying attitudes towards vaccination over content classification as baseline. We evaluate a variety of network embedding algorithms, which we combine with text embedding to obtain classifiers for vaccination skeptic content. In our experiments, by using Walklets, we improve the AUC of the best classifier with no network information by. We publicly release our labels, Tweet IDs and source codes on GitHub.</p>","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":1.3,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9933796/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10765431","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
Fraud, corruption, and collusion in public procurement activities, a systematic literature review on data-driven methods 公共采购活动中的欺诈、腐败和勾结,关于数据驱动方法的系统文献综述
IF 2.2 Q1 Multidisciplinary Pub Date : 2022-12-15 DOI: 10.1007/s41109-022-00523-6
Marcos S. Lyra, B. Damásio, Flávio L. Pinheiro, F. Bação
{"title":"Fraud, corruption, and collusion in public procurement activities, a systematic literature review on data-driven methods","authors":"Marcos S. Lyra, B. Damásio, Flávio L. Pinheiro, F. Bação","doi":"10.1007/s41109-022-00523-6","DOIUrl":"https://doi.org/10.1007/s41109-022-00523-6","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45918762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Social networks for enhanced player churn prediction in mobile free-to-play games 社交网络在移动免费游戏中增强玩家流失预测
IF 2.2 Q1 Multidisciplinary Pub Date : 2022-12-15 DOI: 10.1007/s41109-022-00524-5
M. Óskarsdóttir, Kristín Eva Gísladóttir, Ragnar Stefánsson, Damián E. Aleman, Carlos Sarraute
{"title":"Social networks for enhanced player churn prediction in mobile free-to-play games","authors":"M. Óskarsdóttir, Kristín Eva Gísladóttir, Ragnar Stefánsson, Damián E. Aleman, Carlos Sarraute","doi":"10.1007/s41109-022-00524-5","DOIUrl":"https://doi.org/10.1007/s41109-022-00524-5","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2022-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42859870","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
Towards a better understanding of the characteristics of fractal networks 为了更好地理解分形网络的特征
IF 2.2 Q1 Multidisciplinary Pub Date : 2022-12-06 DOI: 10.1007/s41109-023-00537-8
Eniko Zakar-Polyák, Marcell Nagy, Roland Molontay
{"title":"Towards a better understanding of the characteristics of fractal networks","authors":"Eniko Zakar-Polyák, Marcell Nagy, Roland Molontay","doi":"10.1007/s41109-023-00537-8","DOIUrl":"https://doi.org/10.1007/s41109-023-00537-8","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2022-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42837900","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
A road network simplification algorithm that preserves topological properties 一种保留拓扑特性的路网简化算法
IF 2.2 Q1 Multidisciplinary Pub Date : 2022-12-01 DOI: 10.1007/s41109-022-00521-8
Jinyoung Pung, R. D’Souza, D. Ghosal, Michael Zhang
{"title":"A road network simplification algorithm that preserves topological properties","authors":"Jinyoung Pung, R. D’Souza, D. Ghosal, Michael Zhang","doi":"10.1007/s41109-022-00521-8","DOIUrl":"https://doi.org/10.1007/s41109-022-00521-8","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47208199","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
Cross-validation of correlation networks using modular structure 利用模块结构对相关网络进行交叉验证
IF 2.2 Q1 Multidisciplinary Pub Date : 2022-11-15 DOI: 10.1007/s41109-022-00516-5
Magnus Neuman, Viktor Jonsson, J. Calatayud, M. Rosvall
{"title":"Cross-validation of correlation networks using modular structure","authors":"Magnus Neuman, Viktor Jonsson, J. Calatayud, M. Rosvall","doi":"10.1007/s41109-022-00516-5","DOIUrl":"https://doi.org/10.1007/s41109-022-00516-5","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2022-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46620934","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
Deterministic random walk model in NetLogo and the identification of asymmetric saturation time in random graph NetLogo中的确定性随机游动模型与随机图中非对称饱和时间的识别
IF 2.2 Q1 Multidisciplinary Pub Date : 2022-11-09 DOI: 10.1007/s41109-023-00559-2
Ayan Chatterjee, Qingtao Cao, A. Sajadi, B. Ravandi
{"title":"Deterministic random walk model in NetLogo and the identification of asymmetric saturation time in random graph","authors":"Ayan Chatterjee, Qingtao Cao, A. Sajadi, B. Ravandi","doi":"10.1007/s41109-023-00559-2","DOIUrl":"https://doi.org/10.1007/s41109-023-00559-2","url":null,"abstract":"","PeriodicalId":37010,"journal":{"name":"Applied Network Science","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2022-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41876202","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