Alberto Dennunzio

Dr. Alberto Dennunzio


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 June 2020 in Information Sciences
Verified
Journal Article
Closed access
ADAlberto Dennunzio
Alberto Dennunzio
Enrico FormentiEnrico Formenti
Enrico Formenti
DGDarij Grinberg
Darij Grinberg
LMLuciano Margara
Luciano Margara

30 October 2023 in IEEE Access
Verified
Journal Article
Open access
ADAlberto Dennunzio
Alberto Dennunzio
Enrico FormentiEnrico Formenti
Enrico Formenti
LMLuciano Margara
Luciano Margara
Additive cellular automata over a finite abelian group are a wide class of cellular automata (CA) that are able to exhibit most of the complex behaviors of general CA and they are often exploited for designing applications in different practical contexts. We provide an easy to check algebraic characterization of positive expansivity for Additive Cellular Automata over a finite abelian group. We stress that positive expansivity is an important property that defines a condition of strong chaos for CA and, for this reason, an easy to check characterization of positive expansivity turns out to be crucial for designing proper applications based on Additive CA and where a condition of strong chaos is required. First of all, in the paper an easy to check algebraic characterization of positive expansivity is provided for the non trivial subclass of Linear Cellular Automata over the alphabet (Z/ m Z) n . Then, we show how it can be exploited to decide positive expansivity for the whole class of Additive Cellular Automata over a finite abelian group.

30 August 2024 in IEEE Access
Verified
Journal Article
Open access
ADAlberto Dennunzio
Alberto Dennunzio
Enrico FormentiEnrico Formenti
Enrico Formenti
LMLuciano Margara
Luciano Margara
During the last few decades, significant efforts have been devoted to analyze the dynamical behavior of cellular automata (CAs) on cyclic groups, their Cartesian power (referred to as linear cellular automata), and on general abelian groups (referred to as additive cellular automata). Many fundamental properties describing the dynamical behavior of a system such as injectivity, surjectivity, sentitivity to the initial conditions, topological transitivity, ergodicity, positive expansivity, denseness of periodic orbits, and chaos have been fully characterized for these classes of cellular automata, i.e., the relation between the cellular automaton (CA) local rule and the CA global behavior was made explicit, being this task a challenging and important problem in CA general theory. A natural step forward leads to investigate the dynamical behavior of group cellular automata, i.e., cellular automata defined on (not necessarily abelian) finite groups. Despite the work recently carried out by some authors, none of the previously mentioned properties has yet been fully characterized in the case of general finite groups. In this paper, we study the dynamical behavior of cellular automata on a number of classes of finite groups such as simple, symmetric, alternating, dihedral, quaternion and decomposable groups and we provide exact characterizations for some of the above mentioned properties. To do this, in each of those classes, we focus our attention to the non-abelian scenarios. Some results are quite surprising because they show that the non-abelianness of the group imposes strong limitations on defining the local rule of the cellular automaton, making the class of group cellular automata very constrained. Finally, we also introduce a graph allowing one to build and study the local rules of any group cellular automaton.

10 December 2020
Verified
Book Chapter
Closed access
PDF file
ADAlberto Dennunzio
Alberto Dennunzio
Enrico FormentiEnrico Formenti
Enrico Formenti
LMLuciano Margara
Luciano Margara
VMValentin Montmirail
Valentin Montmirail
SRSara Riva
Sara Riva


31 August 2023 in Natural Computing
Verified
Journal Article
Open access
PDF file
SBStefania Bandini
Stefania Bandini
Daniela BriolaDaniela Briola
Daniela Briola
ADAlberto Dennunzio
Alberto Dennunzio
FGFrancesca Gasparini
Francesca Gasparini
MGMarta Giltri
Marta Giltri
Giuseppe VizzariGiuseppe Vizzari
Giuseppe Vizzari
Cellular Automata have successfully been successfully applied to the modeling and simulation of pedestrian and crowd dynamics. In particular, the investigated scenarios have often been focused on the evaluation of medium–high population density situations, in which the motivation of pedestrians to reach a certain location overcomes their tendency to naturally respect proxemic distances. The global COVID-19 outbreak, though, has shown that sometimes it is crucial to contemplate how proxemic tendencies are emphasized and amplified by the affective state of the individuals involved in the scenario, representing an important factor to take into consideration when investigating the behaviour of a crowd. In this paper we present a research effort aimed at integrating results of quantitative analyses regarding the effects of affective states on the perception of distances maintained by different types of pedestrians with the modeling of pedestrian movement choices in a cellular automata framework.