首页 > 最新文献

Advances in Complex Systems最新文献

英文 中文
A Self-Modeling Network Model Addressing Controlled Adaptive Mental Models for Analysis and Support Processes 一种自建模网络模型,用于分析和支持过程的受控自适应心理模型
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.483
J. Treur
In this paper, a self-modeling mental network model is presented for cognitive analysis and support processes for a human. These cognitive analysis and support processes are modeled by internal mental models. At the base level, the model is able to perform the analysis and support processes based on these internal mental models. To obtain adaptation of these internal mental models, a first-order self-model is included in the network model. In addition, to obtain control of this adaptation, a second-order self-model is included. This makes the network model a second-order self-modeling network model. The adaptive network model is illustrated for a number of realistic scenarios for a supported car driver.
本文提出了一种用于人的认知分析和支持过程的自建模心理网络模型。这些认知分析和支持过程是由内部心理模型建模的。在基础级别,模型能够基于这些内部心智模型执行分析和支持流程。为了获得这些内部心理模型的适应性,在网络模型中加入了一阶自我模型。此外,为了控制这种自适应,还引入了一个二阶自模型。这使得网络模型成为一个二阶自建模网络模型。该自适应网络模型是一个支持汽车驾驶员的一些现实场景。
{"title":"A Self-Modeling Network Model Addressing Controlled Adaptive Mental Models for Analysis and Support Processes","authors":"J. Treur","doi":"10.25088/complexsystems.30.4.483","DOIUrl":"https://doi.org/10.25088/complexsystems.30.4.483","url":null,"abstract":"In this paper, a self-modeling mental network model is presented for cognitive analysis and support processes for a human. These cognitive analysis and support processes are modeled by internal mental models. At the base level, the model is able to perform the analysis and support processes based on these internal mental models. To obtain adaptation of these internal mental models, a first-order self-model is included in the network model. In addition, to obtain control of this adaptation, a second-order self-model is included. This makes the network model a second-order self-modeling network model. The adaptive network model is illustrated for a number of realistic scenarios for a supported car driver.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"39 1","pages":"483-512"},"PeriodicalIF":0.4,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80452314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Comparing Methods for Measuring Walkability 比较测量步行性的方法
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.539
A. Bramson, Kazuto Okamoto, Megumi Hori
Walkability analyses have gained increased attention for economic, environmental and health reasons, but the methods for assessing walkability have yet to be broadly evaluated. In this paper, five methods for calculating walkability scores are described: in-radius, circle buffers, road network node buffers, road network edge buffers and a fully integrated network approach. Unweighted and various weighted versions are analyzed to capture levels of preference for walking longer distances. The methods are evaluated via an application to train stations in central Tokyo in terms of accuracy, similarity and algorithm performance. The fully integrated network method produces the most accurate results in the shortest amount of processing time, but requires a large upfront investment of time and resources. The circle buffer method runs a bit slower, but does not require any network information and when properly weighted yields walkability scores very similar to the integrated network approach.
由于经济、环境和健康的原因,可步行性分析越来越受到关注,但评估可步行性的方法尚未得到广泛的评价。本文描述了五种计算步行性评分的方法:半径内缓冲区、圆形缓冲区、路网节点缓冲区、路网边缘缓冲区和完全集成的网络方法。对未加权和各种加权版本进行分析,以捕捉对长距离步行的偏好程度。通过在东京市中心火车站的应用,对这些方法的准确性、相似性和算法性能进行了评估。完全集成的网络方法在最短的处理时间内产生最准确的结果,但需要大量的前期时间和资源投入。循环缓冲方法运行速度稍慢,但不需要任何网络信息,并且当适当加权时产生的步行性得分与集成网络方法非常相似。
{"title":"Comparing Methods for Measuring Walkability","authors":"A. Bramson, Kazuto Okamoto, Megumi Hori","doi":"10.25088/complexsystems.30.4.539","DOIUrl":"https://doi.org/10.25088/complexsystems.30.4.539","url":null,"abstract":"Walkability analyses have gained increased attention for economic, environmental and health reasons, but the methods for assessing walkability have yet to be broadly evaluated. In this paper, five methods for calculating walkability scores are described: in-radius, circle buffers, road network node buffers, road network edge buffers and a fully integrated network approach. Unweighted and various weighted versions are analyzed to capture levels of preference for walking longer distances. The methods are evaluated via an application to train stations in central Tokyo in terms of accuracy, similarity and algorithm performance. The fully integrated network method produces the most accurate results in the shortest amount of processing time, but requires a large upfront investment of time and resources. The circle buffer method runs a bit slower, but does not require any network information and when properly weighted yields walkability scores very similar to the integrated network approach.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"1 1","pages":"539-565"},"PeriodicalIF":0.4,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75771224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Transfer Learning for Node Regression Applied to Spreading Prediction 节点回归迁移学习在扩展预测中的应用
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.457
Sebastian Mežnar, N. Lavrač, Blaž Škrlj
Understanding how information propagates in real-life complex networks yields a better understanding of dynamic processes such as misinformation or epidemic spreading. The recently introduced branch of machine learning methods for learning node representations offers many novel applications, one of them being the task of spreading prediction addressed in this paper. We explore the utility of the state-of-the-art node representation learners when used to assess the effects of spreading from a given node, estimated via extensive simulations. Further, as many real-life networks are topologically similar, we systematically investigate whether the learned models generalize to previously unseen networks, showing that in some cases very good model transfer can be obtained. This paper is one of the first to explore transferability of the learned representations for the task of node regression; we show there exist pairs of networks with similar structure between which the trained models can be transferred (zero-shot) and demonstrate their competitive performance. To our knowledge, this is one of the first attempts to evaluate the utility of zero-shot transfer for the task of node regression.
了解信息如何在现实生活中的复杂网络中传播,可以更好地理解诸如错误信息或流行病传播等动态过程。最近引入的用于学习节点表示的机器学习方法分支提供了许多新的应用,其中之一就是本文所讨论的扩展预测任务。我们探索了最先进的节点表示学习器在用于评估从给定节点传播的影响时的效用,通过广泛的模拟估计。此外,由于许多现实生活中的网络拓扑相似,我们系统地研究了学习到的模型是否可以推广到以前未见过的网络,结果表明在某些情况下可以获得非常好的模型迁移。本文是第一个探索节点回归任务中学习表征的可转移性的论文之一;我们证明存在具有相似结构的网络对,训练模型可以在它们之间转移(零射击),并展示它们的竞争性能。据我们所知,这是第一次尝试评估零点转移对节点回归任务的效用。
{"title":"Transfer Learning for Node Regression Applied to Spreading Prediction","authors":"Sebastian Mežnar, N. Lavrač, Blaž Škrlj","doi":"10.25088/complexsystems.30.4.457","DOIUrl":"https://doi.org/10.25088/complexsystems.30.4.457","url":null,"abstract":"Understanding how information propagates in real-life complex networks yields a better understanding of dynamic processes such as misinformation or epidemic spreading. The recently introduced branch of machine learning methods for learning node representations offers many novel applications, one of them being the task of spreading prediction addressed in this paper. We explore the utility of the state-of-the-art node representation learners when used to assess the effects of spreading from a given node, estimated via extensive simulations. Further, as many real-life networks are topologically similar, we systematically investigate whether the learned models generalize to previously unseen networks, showing that in some cases very good model transfer can be obtained. This paper is one of the first to explore transferability of the learned representations for the task of node regression; we show there exist pairs of networks with similar structure between which the trained models can be transferred (zero-shot) and demonstrate their competitive performance. To our knowledge, this is one of the first attempts to evaluate the utility of zero-shot transfer for the task of node regression.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"71 1","pages":"457-481"},"PeriodicalIF":0.4,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76766391","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The Impact of Edge Correlations in Random Networks 随机网络中边缘相关性的影响
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.525
A. Faragó
Random graphs are frequently used models of real-life random networks. The classical Erdös–Rényi random graph model is very well explored and has numerous nontrivial properties. In particular, a good number of important graph parameters that are hard to compute in the deterministic case often become much easier in random graphs. However, a fundamental restriction in the Erdös–Rényi random graph is that the edges are required to be probabilistically independent. This is a severe restriction, which does not hold in most real-life networks. We consider more general random graphs in which the edges may be dependent. Specifically, two models are analyzed. The first one is called a p-robust random graph. It is defined by the requirement that each edge exist with probability at least p, no matter how we condition on the presence/absence of other edges. It is significantly more general than assuming independent edges existing with probability p, as exemplified via several special cases. The second model considers the case when the edges are positively correlated, which means that the edge probability is at least p for each edge, no matter how we condition on the presence of other edges (but absence is not considered). We prove some interesting, nontrivial properties about both models.
随机图是现实生活中常用的随机网络模型。经典的Erdös-Rényi随机图模型得到了很好的研究,并具有许多非平凡性质。特别是,在确定性情况下难以计算的大量重要图参数在随机图中往往变得容易得多。然而,Erdös-Rényi随机图的一个基本限制是要求边是概率独立的。这是一个严重的限制,在大多数现实生活中的网络中并不成立。我们考虑更一般的随机图,其中的边可能是相关的。具体分析了两种模型。第一个被称为p鲁棒随机图。它的定义是要求每条边的存在概率至少为p,无论我们如何确定其他边的存在与否。它比假设独立边以p的概率存在要普遍得多,通过几个特殊的例子来证明。第二个模型考虑的是边是正相关的情况,这意味着每条边的边概率至少为p,无论我们如何确定其他边的存在(但不考虑缺席)。我们证明了关于这两个模型的一些有趣的,非平凡的性质。
{"title":"The Impact of Edge Correlations in Random Networks","authors":"A. Faragó","doi":"10.25088/complexsystems.30.4.525","DOIUrl":"https://doi.org/10.25088/complexsystems.30.4.525","url":null,"abstract":"Random graphs are frequently used models of real-life random networks. The classical Erdös–Rényi random graph model is very well explored and has numerous nontrivial properties. In particular, a good number of important graph parameters that are hard to compute in the deterministic case often become much easier in random graphs. However, a fundamental restriction in the Erdös–Rényi random graph is that the edges are required to be probabilistically independent. This is a severe restriction, which does not hold in most real-life networks. We consider more general random graphs in which the edges may be dependent. Specifically, two models are analyzed. The first one is called a p-robust random graph. It is defined by the requirement that each edge exist with probability at least p, no matter how we condition on the presence/absence of other edges. It is significantly more general than assuming independent edges existing with probability p, as exemplified via several special cases. The second model considers the case when the edges are positively correlated, which means that the edge probability is at least p for each edge, no matter how we condition on the presence of other edges (but absence is not considered). We prove some interesting, nontrivial properties about both models.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":" November","pages":"525-537"},"PeriodicalIF":0.4,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72378638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extending Proximity Measures to Attributed Networks for Community Detection 将接近度量扩展到属性网络用于社区检测
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.441
Rinat Aynulin, P. Chebotarev
Proximity measures on graphs are extensively used for solving various problems in network analysis, including community detection. Previous studies have considered proximity measures mainly for networks without attributes. However, attribute information, node attributes in particular, allows a more in-depth exploration of the network structure. This paper extends the definition of a number of proximity measures to the case of attributed networks. To take node attributes into account, attribute similarity is embedded into the adjacency matrix. Obtained attribute-aware proximity measures are numerically studied in the context of community detection in real-world networks.
图上的接近度量被广泛用于解决网络分析中的各种问题,包括社区检测。以往的研究主要考虑了无属性网络的接近度量。然而,属性信息,特别是节点属性,允许对网络结构进行更深入的探索。本文将一些接近测度的定义推广到有属性网络的情况。为了考虑节点属性,属性相似度被嵌入到邻接矩阵中。在现实网络社区检测的背景下,对得到的属性感知接近度量进行了数值研究。
{"title":"Extending Proximity Measures to Attributed Networks for Community Detection","authors":"Rinat Aynulin, P. Chebotarev","doi":"10.25088/complexsystems.30.4.441","DOIUrl":"https://doi.org/10.25088/complexsystems.30.4.441","url":null,"abstract":"Proximity measures on graphs are extensively used for solving various problems in network analysis, including community detection. Previous studies have considered proximity measures mainly for networks without attributes. However, attribute information, node attributes in particular, allows a more in-depth exploration of the network structure. This paper extends the definition of a number of proximity measures to the case of attributed networks. To take node attributes into account, attribute similarity is embedded into the adjacency matrix. Obtained attribute-aware proximity measures are numerically studied in the context of community detection in real-world networks.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"199 1","pages":"441-455"},"PeriodicalIF":0.4,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83103082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Impact of Nonlocal Interaction on Chimera States in Nonlocally Coupled Stuart-Landau Oscillators 非局部相互作用对非局部耦合斯图尔特-朗道振子嵌合体态的影响
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.513
K. Premalatha, R. Amuda, V. K. Chandrasekar, M. Senthilvelan, M. Lakshmanan
We investigate the existence of collective dynamical states in nonlocally coupled Stuart–Landau oscillators with symmetry breaking included in the coupling term. We find that the radius of nonlocal interaction and nonisochronicity parameter play important roles in identifying the swing of synchronized states through amplitude chimera states. Collective dynamical states are distinguished with the help of strength of incoherence. Different transition routes to multi-chimera death states are analyzed with respect to the nonlocal coupling radius. In addition, we investigate the existence of collective dynamical states including traveling wave state, amplitude chimera state and multi-chimera death state by introducing higher-order nonlinear terms in the system. We also verify the robustness of the given notable properties for the coupled system.
研究了耦合项中包含对称破缺的非局部耦合Stuart-Landau振子中集体动力学态的存在性。我们发现非局域相互作用半径和非等时性参数在通过振幅嵌合态识别同步态的摆动中起着重要作用。集体动力学状态是借助非相干强度来区分的。从非局部耦合半径角度分析了多嵌合体死亡状态的不同过渡路径。此外,通过在系统中引入高阶非线性项,研究了行波态、振幅嵌合体态和多嵌合体死亡态等集体动力学状态的存在性。我们还验证了耦合系统的鲁棒性。
{"title":"Impact of Nonlocal Interaction on Chimera States in Nonlocally Coupled Stuart-Landau Oscillators","authors":"K. Premalatha, R. Amuda, V. K. Chandrasekar, M. Senthilvelan, M. Lakshmanan","doi":"10.25088/complexsystems.30.4.513","DOIUrl":"https://doi.org/10.25088/complexsystems.30.4.513","url":null,"abstract":"We investigate the existence of collective dynamical states in nonlocally coupled Stuart–Landau oscillators with symmetry breaking included in the coupling term. We find that the radius of nonlocal interaction and nonisochronicity parameter play important roles in identifying the swing of synchronized states through amplitude chimera states. Collective dynamical states are distinguished with the help of strength of incoherence. Different transition routes to multi-chimera death states are analyzed with respect to the nonlocal coupling radius. In addition, we investigate the existence of collective dynamical states including traveling wave state, amplitude chimera state and multi-chimera death state by introducing higher-order nonlinear terms in the system. We also verify the robustness of the given notable properties for the coupled system.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"46 1","pages":"513-524"},"PeriodicalIF":0.4,"publicationDate":"2021-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82583046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Network Analysis of Verbal Communications in the Novel the Master and Margarita by M. A. Bulgakov 布尔加科夫小说《大师与玛格丽塔》语言交际的网络分析
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-12-06 DOI: 10.1142/S0219525923500017
Y. Tarasevich, A. V. Danilova, O. E. Romanovskaya
A network analysis of the structure of verbal communications in one of the most popular Russian novels of the Soviet era The Master and Margarita by Bulgakov has been carried out. The structure of the novel is complex (a story within a story). Moreover, the real-world-characters and the other-world-characters are interacting in the novel. This complex and unusual composition makes the novel especially attractive for a network analysis. In our study, only paired verbal communications (conversations) between explicitly present and acting characters have been taken into account. Based on a character pair verbal communication matrix, a graph has been constructed, the vertices of which are the characters of the novel, while the edges correspond to the connections between them. Taking only paired verbal communications into account leads to the result, that the character network can be described by an ordinary, rather than a directed graph. Since the activity of the conversations was out of our intended scope, the edges have been given no weights. The largest connected component of the graph consists of 76 characters. Centralities, such as degree, betweenness, closeness, eigenvector, and assortativity coefficient were computed to characterize the network. The structure of the communities in the network was also analysed. In addition to the obvious large communities-the characters from the Yershalaim part of the novel and the characters of the Moscow part-the analysis also revealed a fine structure in the Moscow component. Using the analysis of centralities, a group of main characters has been detected. The central characters of the novel are Koroviev, Margarita, Bezdomny, Woland, Behemoth, Azazello, Bosoi, Warenukha, Master, and Levi Matthew.
本文对苏联时期最受欢迎的俄罗斯小说之一布尔加科夫的《大师与玛格丽塔》中的语言交际结构进行了网络分析。这部小说的结构很复杂(故事中有故事)。此外,小说中真实世界的人物与虚幻世界的人物是相互作用的。这种复杂而不寻常的构成使得小说对网络分析特别有吸引力。在我们的研究中,只考虑了明确呈现和表演角色之间的配对口头交流(对话)。基于一个人物对言语交际矩阵,构造了一个图,图的顶点是小说中的人物,图的边对应着人物之间的联系。只考虑成对的口头交流导致的结果是,字符网络可以用普通图来描述,而不是有向图。由于对话的活动超出了我们的预期范围,所以边缘没有被赋予权重。图的最大连通部分有76个字符。计算中心性,如程度、中间度、接近度、特征向量和分类系数来表征网络。并对网络中的群落结构进行了分析。除了小说叶尔沙拉姆部分的人物和莫斯科部分的人物之外,分析还揭示了莫斯科部分的精细结构。利用中心性分析,找出了一组主要特征。小说的中心人物是科罗维耶夫、玛格丽塔、贝兹多姆尼、沃兰、比伯斯、阿扎泽洛、博索伊、瓦列努卡、马斯特和列维·马修。
{"title":"Network Analysis of Verbal Communications in the Novel the Master and Margarita by M. A. Bulgakov","authors":"Y. Tarasevich, A. V. Danilova, O. E. Romanovskaya","doi":"10.1142/S0219525923500017","DOIUrl":"https://doi.org/10.1142/S0219525923500017","url":null,"abstract":"A network analysis of the structure of verbal communications in one of the most popular Russian novels of the Soviet era The Master and Margarita by Bulgakov has been carried out. The structure of the novel is complex (a story within a story). Moreover, the real-world-characters and the other-world-characters are interacting in the novel. This complex and unusual composition makes the novel especially attractive for a network analysis. In our study, only paired verbal communications (conversations) between explicitly present and acting characters have been taken into account. Based on a character pair verbal communication matrix, a graph has been constructed, the vertices of which are the characters of the novel, while the edges correspond to the connections between them. Taking only paired verbal communications into account leads to the result, that the character network can be described by an ordinary, rather than a directed graph. Since the activity of the conversations was out of our intended scope, the edges have been given no weights. The largest connected component of the graph consists of 76 characters. Centralities, such as degree, betweenness, closeness, eigenvector, and assortativity coefficient were computed to characterize the network. The structure of the communities in the network was also analysed. In addition to the obvious large communities-the characters from the Yershalaim part of the novel and the characters of the Moscow part-the analysis also revealed a fine structure in the Moscow component. Using the analysis of centralities, a group of main characters has been detected. The central characters of the novel are Koroviev, Margarita, Bezdomny, Woland, Behemoth, Azazello, Bosoi, Warenukha, Master, and Levi Matthew.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"23 1","pages":"2350001:1-2350001:23"},"PeriodicalIF":0.4,"publicationDate":"2021-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85524233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Statistical Properties of Rankings in Sports and Games 体育和游戏中排名的统计特性
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-10-22 DOI: 10.1142/S0219525921500077
José A. Morales, Jorge Flores, C. Gershenson, Carlos Pineda
Any collection can be ranked. Sports and games are common examples of ranked systems: players and teams are constantly ranked using different methods. The statistical properties of rankings have been studied for almost a century in a variety of fields. More recently, data availability has allowed us to study rank dynamics: how elements of a ranking change in time. Here, we study the rank distributions and rank dynamics of 12 datasets from different sports and games. To study rank dynamics, we consider measures that we have defined previously: rank diversity, change probability, rank entropy, and rank complexity. We also introduce a new measure that we call “system closure” that reflects how many elements enter or leave the rankings in time. We use a random walk model to reproduce the observed rank dynamics, showing that a simple mechanism can generate similar statistical properties as the ones observed in the datasets. Our results show that while rank distributions vary considerably for different rankings, rank dynamics have similar behaviors, independently of the nature and competitiveness of the sport or game and its ranking method. Our results also suggest that our measures of rank dynamics are general and applicable for complex systems of different natures.
任何集合都可以排序。体育和游戏是排名系统的常见例子:玩家和团队经常使用不同的方法进行排名。排名的统计特性已经在各个领域进行了近一个世纪的研究。最近,数据可用性使我们能够研究排名动态:排名元素如何随时间变化。在这里,我们研究了来自不同运动和游戏的12个数据集的排名分布和排名动态。为了研究排名动态,我们考虑了我们之前定义的指标:排名多样性、变化概率、排名熵和排名复杂性。我们还引入了一个新措施,我们称之为“系统关闭”,它反映了有多少元素及时进入或离开排名。我们使用随机漫步模型来重现观察到的排名动态,表明一个简单的机制可以产生与数据集中观察到的相似的统计属性。我们的研究结果表明,虽然不同排名的排名分布差异很大,但排名动态具有相似的行为,独立于运动或游戏的性质和竞争力及其排名方法。我们的结果还表明,我们的等级动力学度量是通用的,适用于不同性质的复杂系统。
{"title":"Statistical Properties of Rankings in Sports and Games","authors":"José A. Morales, Jorge Flores, C. Gershenson, Carlos Pineda","doi":"10.1142/S0219525921500077","DOIUrl":"https://doi.org/10.1142/S0219525921500077","url":null,"abstract":"Any collection can be ranked. Sports and games are common examples of ranked systems: players and teams are constantly ranked using different methods. The statistical properties of rankings have been studied for almost a century in a variety of fields. More recently, data availability has allowed us to study rank dynamics: how elements of a ranking change in time. Here, we study the rank distributions and rank dynamics of 12 datasets from different sports and games. To study rank dynamics, we consider measures that we have defined previously: rank diversity, change probability, rank entropy, and rank complexity. We also introduce a new measure that we call “system closure” that reflects how many elements enter or leave the rankings in time. We use a random walk model to reproduce the observed rank dynamics, showing that a simple mechanism can generate similar statistical properties as the ones observed in the datasets. Our results show that while rank distributions vary considerably for different rankings, rank dynamics have similar behaviors, independently of the nature and competitiveness of the sport or game and its ranking method. Our results also suggest that our measures of rank dynamics are general and applicable for complex systems of different natures.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"85 3 1","pages":"2150007:1-2150007:15"},"PeriodicalIF":0.4,"publicationDate":"2021-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87673651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Abm Documentation and odd Protocol in Economics: a bibliometric Analysis 经济学中的Abm文献和奇数协议:文献计量学分析
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-10-18 DOI: 10.1142/s0219525921400038
Emiliano Alvarez, J. Brida, Silvia London
{"title":"Abm Documentation and odd Protocol in Economics: a bibliometric Analysis","authors":"Emiliano Alvarez, J. Brida, Silvia London","doi":"10.1142/s0219525921400038","DOIUrl":"https://doi.org/10.1142/s0219525921400038","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"19 1","pages":"2140003:1-2140003:26"},"PeriodicalIF":0.4,"publicationDate":"2021-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83603762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Global Cities in International Networks of Innovators 国际创新网络中的全球城市
IF 0.4 4区 数学 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Pub Date : 2021-10-13 DOI: 10.1142/s0219525921400026
S. Edet, P. Panzarasa, M. Riccaboni
Recent studies on international networks have investigated the role of global cities as catalysts of knowledge flows. In this paper, we examine global cities in transnational networks of innovators. To assess the likelihood of scientists and inventors from different cities to take part in international teams, we propose a measure based on 3-hyperedges in the collaboration network constructed from scientific publications and patents. This measure is used to identify the most competitive global cities in the international network of innovators. To this end, we construct a null model based on the hypergeometric ensembles of random graphs. We find that five US cities play a leading role in transnational networks of innovators. Among them, San Francisco stands out as the most globalized city.
最近关于国际网络的研究调查了全球城市作为知识流动催化剂的作用。在本文中,我们考察了跨国创新者网络中的全球城市。为了评估来自不同城市的科学家和发明家参与国际团队的可能性,我们提出了一个基于科学出版物和专利构建的合作网络中的3-超边缘的度量。该指标用于确定国际创新网络中最具竞争力的全球城市。为此,我们构造了一个基于随机图的超几何集合的零模型。我们发现,五个美国城市在跨国创新者网络中发挥了主导作用。其中,旧金山作为最全球化的城市脱颖而出。
{"title":"Global Cities in International Networks of Innovators","authors":"S. Edet, P. Panzarasa, M. Riccaboni","doi":"10.1142/s0219525921400026","DOIUrl":"https://doi.org/10.1142/s0219525921400026","url":null,"abstract":"Recent studies on international networks have investigated the role of global cities as catalysts of knowledge flows. In this paper, we examine global cities in transnational networks of innovators. To assess the likelihood of scientists and inventors from different cities to take part in international teams, we propose a measure based on 3-hyperedges in the collaboration network constructed from scientific publications and patents. This measure is used to identify the most competitive global cities in the international network of innovators. To this end, we construct a null model based on the hypergeometric ensembles of random graphs. We find that five US cities play a leading role in transnational networks of innovators. Among them, San Francisco stands out as the most globalized city.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":"63 1","pages":"2140002:1-2140002:24"},"PeriodicalIF":0.4,"publicationDate":"2021-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84712434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Advances in Complex Systems
全部 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