Advances in Complex Systems最新文献_第8页

A Self-Modeling Network Model Addressing Controlled Adaptive Mental Models for Analysis and Support Processes 一种自建模网络模型，用于分析和支持过程的受控自适应心理模型

IF 0.4 4区数学

Advances in Complex Systems Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.483

J. Treur

引用次数: 1

Comparing Methods for Measuring Walkability 比较测量步行性的方法

IF 0.4 4区数学

Advances in Complex Systems Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.539

A. Bramson, Kazuto Okamoto, Megumi Hori

引用次数: 3

Transfer Learning for Node Regression Applied to Spreading Prediction 节点回归迁移学习在扩展预测中的应用

IF 0.4 4区数学

Advances in Complex Systems Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.457

Sebastian Mežnar, N. Lavrač, Blaž Škrlj

{"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区数学

Advances in Complex Systems Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.525

A. Faragó

{"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区数学

Advances in Complex Systems Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.441

Rinat Aynulin, P. Chebotarev

引用次数: 0

Impact of Nonlocal Interaction on Chimera States in Nonlocally Coupled Stuart-Landau Oscillators 非局部相互作用对非局部耦合斯图尔特-朗道振子嵌合体态的影响

IF 0.4 4区数学

Advances in Complex Systems Pub Date : 2021-12-15 DOI: 10.25088/complexsystems.30.4.513

K. Premalatha, R. Amuda, V. K. Chandrasekar, M. Senthilvelan, M. Lakshmanan

引用次数: 0

Network Analysis of Verbal Communications in the Novel the Master and Margarita by M. A. Bulgakov 布尔加科夫小说《大师与玛格丽塔》语言交际的网络分析

IF 0.4 4区数学

Advances in Complex Systems Pub Date : 2021-12-06 DOI: 10.1142/S0219525923500017

Y. Tarasevich, A. V. Danilova, O. E. Romanovskaya

{"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区数学

Advances in Complex Systems Pub Date : 2021-10-22 DOI: 10.1142/S0219525921500077

José A. Morales, Jorge Flores, C. Gershenson, Carlos Pineda

{"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区数学

Advances in Complex Systems Pub Date : 2021-10-18 DOI: 10.1142/s0219525921400038

Emiliano Alvarez, J. Brida, Silvia London

引用次数: 0

Global Cities in International Networks of Innovators 国际创新网络中的全球城市

IF 0.4 4区数学

Advances in Complex Systems Pub Date : 2021-10-13 DOI: 10.1142/s0219525921400026

S. Edet, P. Panzarasa, M. Riccaboni

引用次数: 0