Marco Nurisso

Marco Nurisso

Auto-generated profile, based on publicly available information

Marco Nurisso

Department of Mathematical Sciences Politecnico di Torino Turin Italy

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
1 May 2024 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
MNMarco Nurisso
Marco Nurisso
AAAlexis Arnaudon
Alexis Arnaudon
MLMaxime Lucas
Maxime Lucas
RPRobert L. Peach
Robert L. Peach
PEPaul Expert
Paul Expert
Giovanni PetriGiovanni Petri
Giovanni Petri
Simplicial Kuramoto models have emerged as a diverse and intriguing class of models describing oscillators on simplices rather than nodes. In this paper, we present a unified framework to describe different variants of these models, categorized into three main groups: “simple” models, “Hodge-coupled” models, and “order-coupled” (Dirac) models. Our framework is based on topology and discrete differential geometry, as well as gradient systems and frustrations, and permits a systematic analysis of their properties. We establish an equivalence between the simple simplicial Kuramoto model and the standard Kuramoto model on pairwise networks under the condition of manifoldness of the simplicial complex. Then, starting from simple models, we describe the notion of simplicial synchronization and derive bounds on the coupling strength necessary or sufficient for achieving it. For some variants, we generalize these results and provide new ones, such as the controllability of equilibrium solutions. Finally, we explore a potential application in the reconstruction of brain functional connectivity from structural connectomes and find that simple edge-based Kuramoto models perform competitively or even outperform complex extensions of node-based models.

24 February 2025 in Nature Physics
Verified
Journal Article
Closed access
PDF file
MNMarco Nurisso
Marco Nurisso
MMMarta Morandini
Marta Morandini
MLMaxime Lucas
Maxime Lucas
FVFrancesco Vaccarino
Francesco Vaccarino
TGTommaso Gili
Tommaso Gili
Giovanni PetriGiovanni Petri
Giovanni Petri

2 February 2024 in European Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
MNMarco Nurisso
Marco Nurisso
MRMatteo Raviola
Matteo Raviola
ATAndrea Tosin
Andrea Tosin
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interactions a statistical description of the graph topology, given in terms of the degree distribution embedded in a Boltzmann-type kinetic equation, is sufficient to capture the collective trends of networked interacting systems. This proves the validity of a commonly accepted heuristic assumption in statistically structured graph models, namely that the so-called connectivity of the agents is the only relevant parameter to be retained in a statistical description of the graph topology. Then, we validate our results by testing them numerically against real social network data.

27 October 2025
Verified
Conference Paper
Open access
APAlan Perotti
Alan Perotti
MNMarco Nurisso
Marco Nurisso
Mirko ZaffaroniMirko Zaffaroni
Mirko Zaffaroni

31 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
MNMarco Nurisso
Marco Nurisso
PLPierrick Leroy
Pierrick Leroy
GPGiovanni Petri
Giovanni Petri
FVFrancesco Vaccarino
Francesco Vaccarino
Understanding the properties of the parameter space in feed-forward ReLU networks is critical for effectively analyzing and guiding training dynamics. After initialization, training under gradient flow decisively restricts the parameter space to an algebraic variety that emerges from the homogeneous nature of the ReLU activation function. In this study, we examine two key challenges associated with feed-forward ReLU networks built on general directed acyclic graph (DAG) architectures: the (dis)connectedness of the parameter space and the existence of singularities within it. We extend previous results by providing a thorough characterization of connectedness, highlighting the roles of bottleneck nodes and balance conditions associated with specific subsets of the network. Our findings clearly demonstrate that singularities are intricately connected to the topology of the underlying DAG and its induced sub-networks. We discuss the reachability of these singularities and establish a principled connection with differentiable pruning. We validate our theory with simple numerical experiments.

29 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
MNMarco Nurisso
Marco Nurisso
AAAlexis Arnaudon
Alexis Arnaudon
MLMaxime Lucas
Maxime Lucas
RPRobert L. Peach
Robert L. Peach
PEPaul Expert
Paul Expert
GPGiovanni Petri
Giovanni Petri
Simplicial Kuramoto models have emerged as a diverse and intriguing class of models describing oscillators on simplices rather than nodes. In this paper, we present a unified framework to describe different variants of these models, categorized into three main groups: "simple" models, "Hodge-coupled" models, and "order-coupled" (Dirac) models. Our framework is based on topology, discrete differential geometry as well as gradient flows and frustrations, and permits a systematic analysis of their properties. We establish an equivalence between the simple simplicial Kuramoto model and the standard Kuramoto model on pairwise networks under the condition of manifoldness of the simplicial complex. Then, starting from simple models, we describe the notion of simplicial synchronization and derive bounds on the coupling strength necessary or sufficient for achieving it. For some variants, we generalize these results and provide new ones, such as the controllability of equilibrium solutions. Finally, we explore a potential application in the reconstruction of brain functional connectivity from structural connectomes and find that simple edge-based Kuramoto models perform competitively or even outperform complex extensions of node-based models.