Solstice 2023—International Conference on Discrete Models of Complex Systems

A special issue of Computation (ISSN 2079-3197).

Deadline for manuscript submissions: closed (15 September 2023) | Viewed by 1655

Special Issue Editors

E-Mail Website
Guest Editor
Department of Physics and Astronomy, University of Florence, Via Giovanni Sansone, 1, 50019 Sesto Fiorentino, Italy
Interests: physics of complex systems; complex networks; cellular automata and lattice gas cellular automata; critical systems and phase transitions; cognitive dynamics; evolutionary systems
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Mathematics and Statistics, University of Guelph, Guelph, ON N1G 2W1, Canada
Interests: mathematical modeling, simulation, and analysis of dynamics of complex natural; engineering and social systems; multi-agent-based simulations; cognitive agents; cellular automata and lattice gas cellular automata; computational intelligence; artificial intelligence

Special Issue Information

Dear Colleagues, 

Complex systems are ubiquitous. They include financial markets, highway transportation and telecommunication networks, human economies, musical improvisation, social networks, and biological systems such as development and morphogenesis, the immune system, cancer, and ecology. The key feature of a complex system is that it is composed of many interacting entities exhibiting new emerging properties on a higher scale compared to the properties and behaviors of its individual entities.

Complex systems are studied in the social sciences, engineering, music, physics, biology, and mathematics. The integral part of these interdisciplinary studies forms discrete modeling in terms of cellular automata, lattice gas cellular automata, agent-based models, or complex networks. These models can be seen as the simplest digital laboratories to study phenomena exhibited by complex systems such as self-organization, pattern formation, cooperation, adaptation, competition, or multi-scale phenomena.

The aim of this Special Issue is to show some recent advances in these fields, illustrating the relationship between different fields, spanning from mathematics to physics, chemistry, engineering, informatics, biology, cognitive sciences, and the arts.

Papers may report on original research, discuss methodological aspects, review the current state of the art, or offer perspectives on future prospects. 

Specific methods and fields of applications include, but are not limited to:

  • Mathematical Modeling;
  • Cellular Automata;
  • Lattice Gas Cellular Automata and Lattice Boltzmann Equation;
  • Complex Networks;
  • Discrete Systems;
  • Dynamical Systems, Chaos, and Transport Phenomena;
  • Meteorology and Weather Modeling;
  • Critical Dynamics and Statistics;
  • Cognitive Dynamics and Psychology;
  • Cognitive Agents and Collective Intelligence;
  • Simulation and Analysis of Dynamics of Complex Natural, Engineering, and Social Systems;
  • Multi-agent-based Simulations;
  • Computational Intelligence;
  • Computation, the Arts, and Neuroaesthetics;
  • Virtual Environments and Social Media;
  • Neural Networks and Boltzmann Machines;
  • Biological and Neural Systems;
  • Artificial Intelligence;
  • Evolutionary Systems;
  • Teaching and Popularization of Complex Systems.

Dr. Franco Bagnoli
Prof. Dr. Anna T. Lawniczak
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Computation is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1800 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.


  • complex systems
  • complex networks
  • cellular automata
  • cognitive systems
  • neural networks
  • artificial intelligence
  • biophysical systems

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:


17 pages, 4929 KiB  
Large Independent Sets on Random d-Regular Graphs with Fixed Degree d
by Raffaele Marino and Scott Kirkpatrick
Computation 2023, 11(10), 206; - 17 Oct 2023
Cited by 1 | Viewed by 1278
The maximum independent set problem is a classic and fundamental combinatorial challenge, where the objective is to find the largest subset of vertices in a graph such that no two vertices are adjacent. In this paper, we introduce a novel linear prioritized local [...] Read more.
The maximum independent set problem is a classic and fundamental combinatorial challenge, where the objective is to find the largest subset of vertices in a graph such that no two vertices are adjacent. In this paper, we introduce a novel linear prioritized local algorithm tailored to address this problem on random d-regular graphs with a small and fixed degree d. Through exhaustive numerical simulations, we empirically investigated the independence ratio, i.e., the ratio between the cardinality of the independent set found and the order of the graph, which was achieved by our algorithm across random d-regular graphs with degree d ranging from 5 to 100. Remarkably, for every d within this range, our results surpassed the existing lower bounds determined by theoretical methods. Consequently, our findings suggest new conjectured lower bounds for the MIS problem on such graph structures. This finding has been obtained using a prioritized local algorithm. This algorithm is termed ‘prioritized’ because it strategically assigns priority in vertex selection, thereby iteratively adding them to the independent set. Full article
Show Figures

Figure 1

Back to TopTop