Paolo Frasca
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Paolo Frasca has a total of 138 co-authors. Here are the top co-authors by number of shared publications:
- Wilbert Samuel Rossi
University College Groningen University of Groningen The Netherlands
17 shared publications Fabio Fagnani
Politecnico di Torino
16 shared publications- Fabio Fagnani
Department of Mathematical Sciences "G.L. Lagrange " Politecnico di Torino 10129 Torino Italy
10 shared publications Ruggero Carli
Department of Information Engineering, University of Padova, Padova, Italy
9 shared publications- Simone Baldi
Southeast University
8 shared publications - Carlos Canudas-De-Wit
University Grenoble Alpes
7 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1393-1398
Bayesian Equilibria of Heterogeneous Non-Atomic Routing Games With Private Information
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1393-1398
Open AccessBayesian Equilibria of Heterogeneous Non-Atomic Routing Games With Private Information
- 9 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (1) , 91-103
Opinion Dynamics on Signed Graphs and Graphons
In this paper, we make use of graphon theory to study opinion dynamics on large undirected networks. The opinion dynamics models that we take into consideration allow for negative interactions between the individuals, whose opinions can thus grow apart. We consider both the repelling and the opposing models of negative interactions, which have been studied in the literature. We define the repelling and the opposing dynamics on signed graphons and we show that their initial value problem solutions exist and are unique. We then show that, in a suitable sense, the graphon dynamics is a good approximation of the dynamics on large graphs that converge to a graphon. This result applies to large random graphs that are sampled according to a graphon (W-random graphs), for which we provide a new convergence result under very general assumptions; in particular, the graphs' average degrees only need to grow faster than $\log n$.
- 9 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 13 (1) , 91-103
Opinion Dynamics on Signed Graphs and Graphons
In this paper, we make use of graphon theory to study opinion dynamics on large undirected networks. The opinion dynamics models that we take into consideration allow for negative interactions between the individuals, whose opinions can thus grow apart. We consider both the repelling and the opposing models of negative interactions, which have been studied in the literature. We define the repelling and the opposing dynamics on signed graphons and we show that their initial value problem solutions exist and are unique. We then show that, in a suitable sense, the graphon dynamics is a good approximation of the dynamics on large graphs that converge to a graphon. This result applies to large random graphs that are sampled according to a graphon (W-random graphs), for which we provide a new convergence result under very general assumptions; in particular, the graphs' average degrees only need to grow faster than $\log n$.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1159-1164
A Coupled Friedkin–Johnsen Model of Popularity Dynamics in Social Media
Popularity dynamics in social media depend on a complex interplay of social influence between users and popularity-based recommendations that are provided by the platforms. In this work, we introduce a discrete-time dynamical system to model the evolution of popularity on social media. Our model generalizes the well-known Friedkin-Johnsen model to a set of influencers vying for popularity. We study the asymptotic behavior of this model and illustrate it with numerical examples. Our results highlight the interplay of social influence, past popularity, and content quality in determining the popularity of influencers.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1159-1164
A Coupled Friedkin–Johnsen Model of Popularity Dynamics in Social Media
Popularity dynamics in social media depend on a complex interplay of social influence between users and popularity-based recommendations that are provided by the platforms. In this work, we introduce a discrete-time dynamical system to model the evolution of popularity on social media. Our model generalizes the well-known Friedkin-Johnsen model to a set of influencers vying for popularity. We study the asymptotic behavior of this model and illustrate it with numerical examples. Our results highlight the interplay of social influence, past popularity, and content quality in determining the popularity of influencers.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1339-1344
Frequency Synchronization and Phase Ordering of Bounded Confidence Oscillators
Limited range of phase measurements motivates the analysis of coupled oscillators that interact if their geodesic distances are within a prescribed bound. Steady state behaviors of this system depend on the natural frequencies of the oscillators and on the underlying graph structure. A necessary and sufficient condition is provided for the graph to remain complete. If the graph is connected over time, it is proved that phase ordering is preserved among the oscillators according to their natural frequencies. The asymptotic convergence to frequency synchronization is proved if the graph is assumed to stay connected and all natural frequencies are the same. A comprehensive analysis of the three-oscillator case shows that phase ordering is not necessary for frequency synchronization, and that graph connectivity, together with an appropriate bound on the range of natural frequencies, ensures frequency synchronization.
- 12 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1339-1344
Frequency Synchronization and Phase Ordering of Bounded Confidence Oscillators
Limited range of phase measurements motivates the analysis of coupled oscillators that interact if their geodesic distances are within a prescribed bound. Steady state behaviors of this system depend on the natural frequencies of the oscillators and on the underlying graph structure. A necessary and sufficient condition is provided for the graph to remain complete. If the graph is connected over time, it is proved that phase ordering is preserved among the oscillators according to their natural frequencies. The asymptotic convergence to frequency synchronization is proved if the graph is assumed to stay connected and all natural frequencies are the same. A comprehensive analysis of the three-oscillator case shows that phase ordering is not necessary for frequency synchronization, and that graph connectivity, together with an appropriate bound on the range of natural frequencies, ensures frequency synchronization.
- 1 June 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 206 (2) , 1-21
A Continuous Opinions Discrete Actions Model on Line Graphs
- 1 June 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 206 (2) , 1-21
A Continuous Opinions Discrete Actions Model on Line Graphs
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (10) , 6861-6868
Model Reference Adaptive Stabilizing Control for Leader-Following Consensus
Complex networks, neuroscience, and other applications have shown examples of multiagent adaptive systems that must follow (over possibly short times) reference dynamics that are neither Hurwitz nor neutrally stable. However, such leader-following behavior would be impossible with existing adaptive consensus methods, e.g., based on model reference adaptive control, since the stability of the reference dynamics is required. To fill this gap, we propose a novel model reference adaptive stabilizing control framework for leader-following consensus of multiagent systems with unknown and heterogeneous dynamics. Differently from several approaches in the leader-following consensus literature, the proposed framework is free of any extra distributed observer layer for the leader's signal, as the reconstruction of such signals is intrinsic in the adaptive laws. Besides, the framework does not require Hurwitz or neutral stability of the leader and generalizes existing acyclic requirements on the communication graph among the follower. Starting from any weakly connected communication digraph, the proposed method allows us to derive a lower bound, useful from the network design point of view, for the minimum number of followers that should be pinned by the leader.
- 18 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (10) , 6861-6868
Model Reference Adaptive Stabilizing Control for Leader-Following Consensus
Complex networks, neuroscience, and other applications have shown examples of multiagent adaptive systems that must follow (over possibly short times) reference dynamics that are neither Hurwitz nor neutrally stable. However, such leader-following behavior would be impossible with existing adaptive consensus methods, e.g., based on model reference adaptive control, since the stability of the reference dynamics is required. To fill this gap, we propose a novel model reference adaptive stabilizing control framework for leader-following consensus of multiagent systems with unknown and heterogeneous dynamics. Differently from several approaches in the leader-following consensus literature, the proposed framework is free of any extra distributed observer layer for the leader's signal, as the reconstruction of such signals is intrinsic in the adaptive laws. Besides, the framework does not require Hurwitz or neutral stability of the leader and generalizes existing acyclic requirements on the communication graph among the follower. Starting from any weakly connected communication digraph, the proposed method allows us to derive a lower bound, useful from the network design point of view, for the minimum number of followers that should be pinned by the leader.
- 26 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (11) , 7600-7613
Random Coordinate Descent for Resource Allocation in Open Multiagent Systems
We propose a method for analyzing the distributed random coordinate descent algorithm for solving separable resource allocation problems in the context of an open multiagent system, where agents can be replaced during the process. In particular, we characterize the evolution of the distance to the minimizer in expectation by following a time-varying optimization approach which builds on two components. First, we establish the linear convergence of the algorithm in closed systems, in terms of the estimate toward the minimizer, for general graphs and appropriate step-size. Second, we estimate the change of the optimal solution after a replacement, in order to evaluate its effect on the distance between the current estimate and the minimizer. From these two elements, we derive stability conditions in open systems and establish the linear convergence of the algorithm toward a steady-state expected error. Our results enable to characterize the tradeoff between speed of convergence and robustness to agent replacements, under the assumptions that local functions are smooth, strongly convex, and have their minimizers located in a given ball. The approach proposed in this article can moreover be extended to other algorithms guaranteeing linear convergence in closed system.
- 26 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (11) , 7600-7613
Random Coordinate Descent for Resource Allocation in Open Multiagent Systems
We propose a method for analyzing the distributed random coordinate descent algorithm for solving separable resource allocation problems in the context of an open multiagent system, where agents can be replaced during the process. In particular, we characterize the evolution of the distance to the minimizer in expectation by following a time-varying optimization approach which builds on two components. First, we establish the linear convergence of the algorithm in closed systems, in terms of the estimate toward the minimizer, for general graphs and appropriate step-size. Second, we estimate the change of the optimal solution after a replacement, in order to evaluate its effect on the distance between the current estimate and the minimizer. From these two elements, we derive stability conditions in open systems and establish the linear convergence of the algorithm toward a steady-state expected error. Our results enable to characterize the tradeoff between speed of convergence and robustness to agent replacements, under the assumptions that local functions are smooth, strongly convex, and have their minimizers located in a given ball. The approach proposed in this article can moreover be extended to other algorithms guaranteeing linear convergence in closed system.
- 21 March 2024
- Published by Springer Nature
- p. 1-4
Introduction
- Open Access
Resilience in Platoons of Cooperative Heterogeneous Vehicles: Self-organization Strategies and Provably-correct Design
This work proposes provably-correct self-organizing strategies for platoons of heterogeneous vehicles. We refer to self-organization as the capability of a platoon to autonomously homogenize to a common group behavior. We show that self-organization promotes resilience to acceleration limits and communication failures, i.e., homogenizing to a common group behavior makes the platoon recover from these causes of impairments. In the presence of acceleration limits, resilience is achieved by self-organizing to a common constrained group behavior that prevents the vehicles from hitting their acceleration limits. In the presence of communication failures, resilience is achieved by self-organizing to a common group observer to estimate the missing information. Stability of the self-organization mechanism is studied analytically, and correctness with respect to traffic actions (e.g. emergency braking, cut-in, merging) is realized through a provably-correct safety layer. Numerical validations via the platooning toolbox OpenCDA in CARLA and via the CommonRoad platform confirm improved performance through self-organization and the provably-correct safety layer.
Open AccessResilience in Platoons of Cooperative Heterogeneous Vehicles: Self-organization Strategies and Provably-correct Design
This work proposes provably-correct self-organizing strategies for platoons of heterogeneous vehicles. We refer to self-organization as the capability of a platoon to autonomously homogenize to a common group behavior. We show that self-organization promotes resilience to acceleration limits and communication failures, i.e., homogenizing to a common group behavior makes the platoon recover from these causes of impairments. In the presence of acceleration limits, resilience is achieved by self-organizing to a common constrained group behavior that prevents the vehicles from hitting their acceleration limits. In the presence of communication failures, resilience is achieved by self-organizing to a common group observer to estimate the missing information. Stability of the self-organization mechanism is studied analytically, and correctness with respect to traffic actions (e.g. emergency braking, cut-in, merging) is realized through a provably-correct safety layer. Numerical validations via the platooning toolbox OpenCDA in CARLA and via the CommonRoad platform confirm improved performance through self-organization and the provably-correct safety layer.