Pub Date : 2022-07-30DOI: 10.1142/s0219525922500060
Mauricio A. Valle, F. Urbina
{"title":"The Backbone of the Financial Interaction Network using a Maximum Entropy Distribution","authors":"Mauricio A. Valle, F. Urbina","doi":"10.1142/s0219525922500060","DOIUrl":"https://doi.org/10.1142/s0219525922500060","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89008570","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}
Pub Date : 2022-07-20DOI: 10.1142/s0219525922400069
Madeleine Janickyj, Dan Curley, Pádraig MacCarron, M. McCarthy, Joseph Yose, R. Kenna
{"title":"The Enigmatic Fráoch and his eponymous Tale - Network Analysis of an Early Irish Heroic Romance","authors":"Madeleine Janickyj, Dan Curley, Pádraig MacCarron, M. McCarthy, Joseph Yose, R. Kenna","doi":"10.1142/s0219525922400069","DOIUrl":"https://doi.org/10.1142/s0219525922400069","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81893698","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}
Pub Date : 2022-07-20DOI: 10.1142/s0219525922020015
Leonardo Bargigli, G. Ricchiuti
{"title":"Networks, Heterogeneity and Evolution in Economics: a Short Review","authors":"Leonardo Bargigli, G. Ricchiuti","doi":"10.1142/s0219525922020015","DOIUrl":"https://doi.org/10.1142/s0219525922020015","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80447487","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}
Pub Date : 2022-07-13DOI: 10.1142/s0219525922400057
Panagiotis (Takis) Iliopoulos, G. Galanis, Ashok Kumar, Lilit Popoyan
{"title":"Sectoral Market Power in Global production: a Theoretical and Observational Study","authors":"Panagiotis (Takis) Iliopoulos, G. Galanis, Ashok Kumar, Lilit Popoyan","doi":"10.1142/s0219525922400057","DOIUrl":"https://doi.org/10.1142/s0219525922400057","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80871793","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}
Pub Date : 2022-06-24DOI: 10.1142/s0219525922400045
J. Borycz, Benjamin D. Horne, R. Bentley
{"title":"Forking Paths of Cultural Complexity: a Case Study of Research Paradigms","authors":"J. Borycz, Benjamin D. Horne, R. Bentley","doi":"10.1142/s0219525922400045","DOIUrl":"https://doi.org/10.1142/s0219525922400045","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77465906","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}
Pub Date : 2022-06-24DOI: 10.1142/s0219525921500181
Ziyan Zhu, Xiaoxing Liu
{"title":"Risk Contagion due to Overlapping Portfolios with Leverage Decision","authors":"Ziyan Zhu, Xiaoxing Liu","doi":"10.1142/s0219525921500181","DOIUrl":"https://doi.org/10.1142/s0219525921500181","url":null,"abstract":"","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76467767","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}
Pub Date : 2022-06-17DOI: 10.1142/S0219525922400033
Vincent Labatut
The task of extracting and analyzing character networks from works of fiction, such as novels and movies, has been the object of a number of recent publications. However, only a very few of them focus on graphic novels, and even fewer on European graphic novels. In this article, we focus on Thorgal, a bande dessin{'e}e, i.e. a comic of the French-Belgian tradition. We manually annotate all the volumes of this series, in order to constitute a corpus allowing us to extract its character network. We perform a descriptive analysis of the network structure and compare it to real-world and fictional social networks. We also study the effect of character filtering over the network structure. Finally, we leverage complex network analysis tools to answer two research questions from the literature, related to the similarity between Thorgal and the Saga of Icelanders; and to the position of women in the series. Our data and source code are both publicly available online.
{"title":"Complex Network Analysis of a Graphic Novel: The Case of the Bande Dessinée Thorgal","authors":"Vincent Labatut","doi":"10.1142/S0219525922400033","DOIUrl":"https://doi.org/10.1142/S0219525922400033","url":null,"abstract":"The task of extracting and analyzing character networks from works of fiction, such as novels and movies, has been the object of a number of recent publications. However, only a very few of them focus on graphic novels, and even fewer on European graphic novels. In this article, we focus on Thorgal, a bande dessin{'e}e, i.e. a comic of the French-Belgian tradition. We manually annotate all the volumes of this series, in order to constitute a corpus allowing us to extract its character network. We perform a descriptive analysis of the network structure and compare it to real-world and fictional social networks. We also study the effect of character filtering over the network structure. Finally, we leverage complex network analysis tools to answer two research questions from the literature, related to the similarity between Thorgal and the Saga of Icelanders; and to the position of women in the series. Our data and source code are both publicly available online.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83720798","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}
Pub Date : 2022-06-15DOI: 10.25088/complexsystems.31.2.165
S. Wolfram
This is the first of a series of pieces I’m planning in connection with the upcoming 20th anniversary [1] of the publication of A New Kind of Science [2] (September 23, 2021).
{"title":"Charting a Course for \"Complexity\": Metamodeling, Ruliology and More","authors":"S. Wolfram","doi":"10.25088/complexsystems.31.2.165","DOIUrl":"https://doi.org/10.25088/complexsystems.31.2.165","url":null,"abstract":"This is the first of a series of pieces I’m planning in connection with the upcoming 20th anniversary [1] of the publication of A New Kind of Science [2] (September 23, 2021).","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75284636","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}
Pub Date : 2022-06-15DOI: 10.25088/complexsystems.32.1.1
R. Beer
Garden of Eden (GOE) states in cellular automata are grid configurations that have no precursors; that is, they can only occur as initial conditions. Finding individual configurations that minimize or maximize some criterion of interest (e.g., grid size, density, etc.) has been a popular sport in recreational mathematics, but systematic studies of the set of GOEs for a cellular automaton have been rare. This paper presents the current results of an ongoing computational study of GOE configurations in Conway’s Game of Life (GoL) cellular automaton. Specifically, we describe the current status of a map of the layout of GOEs and non-GOEs in 1-density/size space, characterize how the density-dependent structure of the number of precursors varies with increasing grid size as we approach the point where GOEs begin to occur, provide a catalog of all known GOE configurations up to a grid size of 11×11, and initiate a study of the structure of the network of constraints that characterize GOE versus non-GOE configurations.
{"title":"Cultivating the Garden of Eden","authors":"R. Beer","doi":"10.25088/complexsystems.32.1.1","DOIUrl":"https://doi.org/10.25088/complexsystems.32.1.1","url":null,"abstract":"Garden of Eden (GOE) states in cellular automata are grid configurations that have no precursors; that is, they can only occur as initial conditions. Finding individual configurations that minimize or maximize some criterion of interest (e.g., grid size, density, etc.) has been a popular sport in recreational mathematics, but systematic studies of the set of GOEs for a cellular automaton have been rare. This paper presents the current results of an ongoing computational study of GOE configurations in Conway’s Game of Life (GoL) cellular automaton. Specifically, we describe the current status of a map of the layout of GOEs and non-GOEs in 1-density/size space, characterize how the density-dependent structure of the number of precursors varies with increasing grid size as we approach the point where GOEs begin to occur, provide a catalog of all known GOE configurations up to a grid size of 11×11, and initiate a study of the structure of the network of constraints that characterize GOE versus non-GOE configurations.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83393680","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}
Pub Date : 2022-06-15DOI: 10.25088/complexsystems.31.2.219
Thomas Bärecke, Marcin Detyniecki
Graph models are fundamental to any kind of application on structured real-world problems. Any comparison between graphs by a graph distance measure requires the solution of the inexact graph matching problem, which constitutes a hard combinatorial optimization problem. An inexact matching problem includes in its formulation robustness to any type of perturbation, such as, for instance, noise, inherently present in real-world environments. In this paper, we introduce the concept of distance-preserving crossover operators for genetic algorithms for this task. For large graphs, our algorithm outperforms any state-of-the-art approximate algorithm—in particular, genetic algorithms with alternative crossover operators, which are to the best of our knowledge currently limited to no more than 50 nodes. We use a two-level local search heuristic to further enhance the results, pushing the limits to up to 300 nodes: a first local search step is directly integrated into the crossover operator; another one is applied independently during offspring generation.
{"title":"Graph Matching with Distance-Preserving Crossover","authors":"Thomas Bärecke, Marcin Detyniecki","doi":"10.25088/complexsystems.31.2.219","DOIUrl":"https://doi.org/10.25088/complexsystems.31.2.219","url":null,"abstract":"Graph models are fundamental to any kind of application on structured real-world problems. Any comparison between graphs by a graph distance measure requires the solution of the inexact graph matching problem, which constitutes a hard combinatorial optimization problem. An inexact matching problem includes in its formulation robustness to any type of perturbation, such as, for instance, noise, inherently present in real-world environments. In this paper, we introduce the concept of distance-preserving crossover operators for genetic algorithms for this task. For large graphs, our algorithm outperforms any state-of-the-art approximate algorithm—in particular, genetic algorithms with alternative crossover operators, which are to the best of our knowledge currently limited to no more than 50 nodes. We use a two-level local search heuristic to further enhance the results, pushing the limits to up to 300 nodes: a first local search step is directly integrated into the crossover operator; another one is applied independently during offspring generation.","PeriodicalId":50871,"journal":{"name":"Advances in Complex Systems","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79117143","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：