Marco Nurisso
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Marco Nurisso has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
Francesco Vaccarino
Department of Mathematical Sciences Politecnico di Torino Turin Italy
3 shared publicationsGiovanni Petri
NPLab Network Science Institute Northeastern University London London UK
2 shared publications- Giovanni Petri
Northeastern University London
2 shared publications - Maxime Lucas
Department of Mathematics and Namur Institute for Complex Systems (naXys), Université de Namur, Namur, Belgium
2 shared publications - Alan Perotti
Intesa Sanpaolo AI Research
1 shared publication Alexis Arnaudon
Blue Brain Project École polytechnique fédérale de Lausanne (EPFL) Campus Biotech 1202 Geneva Switzerland
1 shared publication
Latest Publications
- Open Access
Topology and Geometry of the Learning Space of ReLU Networks: Connectivity and Singularities
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.
Open AccessTopology and Geometry of the Learning Space of ReLU Networks: Connectivity and Singularities
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.
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 65-72
No Detector to Rule Them All
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 65-72
Open AccessNo Detector to Rule Them All
- 24 February 2025
- Published by Springer Nature in Nature Physics
- Vol. 21 (4) , 661-668
Higher-order Laplacian renormalization
- 24 February 2025
- Published by Springer Nature in Nature Physics
- Vol. 21 (4) , 661-668
Higher-order Laplacian renormalization
- Top Cited Papers
- 1 May 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (5)
A unified framework for simplicial Kuramoto models
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.
- 1 May 2024
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 34 (5)
Top Cited PapersA unified framework for simplicial Kuramoto models
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.
- Open Access
- 2 February 2024
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 37 (3) , 721-742
Network-based kinetic models: Emergence of a statistical description of the graph topology
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.
- 2 February 2024
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 37 (3) , 721-742
Open AccessNetwork-based kinetic models: Emergence of a statistical description of the graph topology
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.
- Open Access
A unified framework for Simplicial Kuramoto models
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.
Open AccessA unified framework for Simplicial Kuramoto models
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.