SearcharxivSearch

arXiv subjects

Chiara Ravazzi

Publications and source records attributed to Chiara Ravazzi.

At least 19 recordsLinked to original sources

On a Coupled Adoption-Opinion Framework for Competing Innovations

In this paper, we propose a two-layer adoption-opinion model to study the diffusion of two competing technologies within a population whose opinions evolve under social influence and adoption-driven feedback. After adopting one technology, individuals may become dissatisfied and switch to the alternative. We prove the existence and uniqueness of the adoption-diffused equilibrium, showing that both technologies coexist and that neither partial-adoption nor monopoly can arise. Numerical simulations show that while opinions shape the equilibrium adoption levels, the relative market share between the two technologies depends solely on their user-experience. As a consequence, interventions that symmetrically boost opinions or adoption can disproportionately favor the higher-quality technology, illustrating how symmetric control actions may generate asymmetric outcomes.

eess.SY

Model Predictive Control for Coupled Adoption-Opinion Dynamics

This paper investigates an optimal control problem for an adoption-opinion model that couples opinion dynamics with a compartmental adoption framework on a multilayer network to study the diffusion of sustainable behaviors. Adoption evolves through social contagion and perceived benefits, while opinions are shaped by social interactions and feedback from adoption levels. Individuals may also stop adopting virtuous behavior due to external constraints or shifting perceptions, affecting overall diffusion. After the stability analysis of equilibria, both in the presence and absence of adopters, we introduce a Model Predictive Control (MPC) framework that optimizes interventions by shaping opinions rather than directly enforcing adoption. This nudge-based control strategy allows policymakers to influence diffusion indirectly, making interventions more effective and scalable. Numerical simulations demonstrate that, in the absence of control, adoption stagnates, whereas MPC-driven interventions sustain and enhance adoption across communities.

eess.SY

Optimal policy design for innovation diffusion: shaping today's incentives for transforming the future

In this paper, we propose a new framework for the design of incentives aimed at promoting innovation diffusion in social influence networks. In particular, our framework relies on an extension of the Friedkin and Johnsen opinion dynamics model characterizing the effects of (i) short-memory incentives, which have an immediate yet transient impact, and (ii) long-term structural incentives, whose impact persists via an exponentially decaying memory. We propose to design these incentives via a model-predictive control (MPC) scheme over an augmented state that captures the memory in our opinion dynamics model, yielding a convex quadratic program with linear constraints. Our numerical simulations based on data on sustainable mobility habits show the effectiveness of the proposed approach, which balances large-scale adoption and resource allocation

eess.SY

Modeling and Control of Sustainable Transitions through Opinion-Behavior Coupling in Heterogeneous Networks

Understanding how sustainable behaviors spread within heterogeneous societies requires the integration of behavioral data, social influence mechanisms, and structured approaches to control. In this paper, we propose a data-driven computational framework for coupled opinion-adoption dynamics in social systems. Each node in the multilayer network represents a community characterized by a specific age group and mobility level, derived from large-scale survey data on the predisposition to adopt electric vehicles in Northern Europe. The proposed model captures three mechanisms: behavioral contagion through social and informational diffusion, abandonment driven by dissatisfaction, and feedback between opinions and adoption levels through social influence. Analyzing the equilibrium points of the coupled system allows us to derive the conditions that enable large-scale adoption. We empirically calibrate the model using data to construct synthetic populations and social similarity networks, which we use to explore targeted interventions that promote sustainable transitions. Specifically, the analysis focuses on two types of control strategies: opinion-based policies, which act on the social network layer, and policies that aim to improve experience and reduce dissatisfaction. Simulation results show that the latter ensure more stable and long-term adoption, offering concrete insights for designing effective interventions in sociotechnical transitions toward sustainability.

cs.SI

Predictive Control Strategies for Sustaining Innovation Adoption on Multilayer Social Networks

This paper studies an optimal control problem for an adoption-opinion model that couples innovation adoption with opinion formation on a multilayer network. Adoption spreads through social contagion and perceived benefits, while opinions evolve via social interactions and feedback from adoption levels. Individuals may abandon adoption due to dissatisfaction or external constraints, potentially hindering diffusion. We analyze system equilibria and their stability, identifying conditions under which adoption persists. We introduce a Model Predictive Control (MPC) strategy that dynamically adapts interventions to the predicted system evolution. Three types of control are compared: shaping opinions, acting on the adoption rate, and reducing dissatisfaction. Overall, MPC interventions outperform static constant control, achieving higher adoption at comparable or lower cost. These results highlight the potential of predictive, adaptive strategies to support sustainable behavior diffusion, offering policymakers scalable tools for effective interventions.

math.OC

Dominance or Fair Play in Social Networks? A Model of Influencer Popularity Dynamic

This paper presents a data-driven mean-field approach to model the popularity dynamics of users seeking public attention, i.e., influencers. We propose a novel analytical model that integrates individual activity patterns, expertise in producing viral content, exogenous events, and the platform's role in visibility enhancement, ultimately determining each influencer's success. We analytically derive sufficient conditions for system ergodicity, enabling predictions of popularity distributions. A sensitivity analysis explores various system configurations, highlighting conditions favoring either dominance or fair play among influencers. Our findings offer valuable insights into the potential evolution of social networks towards more equitable or biased influence ecosystems.

cs.SI

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.

cs.SI

Innovation diffusion dynamics toward long-term behavioral shifts

Sustainable technologies and services can play a pivotal role in the transition to "greener" habits. Their widespread adoption is thus crucial, and understanding how to foster this phenomenon in a systematic way could have a major impact on our future. With this in mind, in this work we propose an extension of the Friedkin-Johnsen opinion dynamics model toward characterizing the long-term impact of (structural) fostering policies. We then propose alternative nudging strategies that target a trade-off between widespread adoption and investments under budget constraints, showing the impact of our modeling and design choices on inclination shifts over a set of numerical tests.

eess.SY

Optimal Policy Design for Repeated Decision-Making under Social Influence

In this paper, we present a novel model to characterize individual tendencies in repeated decision-making scenarios, with the goal of designing model-based control strategies that promote virtuous choices amidst social and external influences. Our approach builds on the classical Friedkin and Johnsen model of social influence, extending it to include random factors (e.g., inherent variability in individual needs) and controllable external inputs. We explicitly account for the temporal separation between two processes that shape opinion dynamics: individual decision-making and social imitation. While individual decisions occur at regular, frequent intervals, the influence of social imitation unfolds over longer periods. The inclusion of random factors naturally leads to dynamics that do not converge in the classical sense. However, under specific conditions, we prove that opinions exhibit ergodic behavior. Building on this result, we propose a constrained asymptotic optimal control problem designed to foster, on average, social acceptance of a target action within a network. To address the transient dynamics of opinions, we reformulate this problem within a Model Predictive Control (MPC) framework. Simulations highlight the significance of accounting for these transient effects in steering individuals toward virtuous choices while managing policy costs.

eess.SY

Optimal policy design for decision problems under social influence

This paper focuses on describing the impact of policy actions on individuals' opinions in the presence of social and external influences toward proposing preliminary nudging strategies to achieve a cost-effectiveness trade-off. To this end, we extend the classical Friedkin and Johnsen model of opinion dynamics to incorporate random factors, such as variability in individual predispositions due to uncontrolled events (e.g., modeling the impact of the weather on daily mobility choices), and describe the impact of personalized policies. Furthermore, we formulate an optimal control problem aimed at fostering the social acceptance of particular actions/choices within the network. Through our analysis and numerical simulations, we illustrate the features of the proposed model in the absence of nudging and the effectiveness of the proposed (optimal) nudging strategies.

eess.SY

Power minimization and resource allocation in HetNets with uncertain channel-gains

We propose an optimization problem to minimize the base stations transmission powers in OFDMA heterogeneous networks, while respecting users' individual throughput demands. The decision variables are the users' working bandwidths, their association, and the base stations transmission powers. To deal with wireless channel uncertainty, the channel gains are treated as random variables respecting a log-normal distribution, leading to a non-convex chance constrained mixed-integer optimization problem, which is then formulated as a mixed-integer Robust Geometric Program. The efficacy of the proposed method is shown in a real-world scenario of a large European city.

math.OC

A Joint Optimization Approach for Power-Efficient Heterogeneous OFDMA Radio Access Networks

Heterogeneous networks have emerged as a popular solution for accommodating the growing number of connected devices and increasing traffic demands in cellular networks. While offering broader coverage, higher capacity, and lower latency, the escalating energy consumption poses sustainability challenges. In this paper a novel optimization approach for OFDMA heterogeneous networks is proposed to minimize transmission power while respecting individual users throughput constraints. The problem is formulated as a mixed integer geometric program, and optimizes at once multiple system variables such as user association, working bandwidth, and base stations transmission powers. Crucially, the proposed approach becomes a convex optimization problem when user-base station associations are provided. Evaluations in multiple realistic scenarios from the production mobile network of a major European operator and based on precise channel gains and throughput requirements from measured data validate the effectiveness of the proposed approach. Overall, our original solution paves the road for greener connectivity by reducing the energy footprint of heterogeneous mobile networks, hence fostering more sustainable communication systems.

math.OC

Planning interventions in a controlled pandemic: the COVID-19 case

Restrictions on social and economic activities, as well as vaccinations, have been a key intervention in containing the COVID-19 epidemic. Our work focuses on better understanding the options available to policymakers under the conditions and uncertainties created by the onset of a new pandemic. More precisely, we focus on two control strategies. The first aims to control the rate of new infections to prevent congestion of the health care system. The latter directly controls hospitalizations and intensive care units (ICUs) occupation. By a first-order analysis, we show that, on the one hand, due to the difficulty in contact tracing and the lack of accurate information, controlling the transmission rate may be difficult, leading to instability. On the other hand, although hospitalizations and ICUs are easily accessible and less noisy than the rate of new infections, a delay is introduced in the control loop, which may endanger system stability. Our framework allows assessing the impact on economic and social costs of the above strategies in a scenario enriched by: i) population heterogeneity in terms of mortality rate and risk exposure, ii) closed-loop control of the epidemiological curve, and iii) progressive vaccination of individuals.

math.OC

On the Design of Structured Stabilizers for LTI Systems

Designing a static state-feedback controller subject to structural constraint achieving asymptotic stability is a relevant problem with many applications, including network decentralized control, coordinated control, and sparse feedback design. Leveraging on the Projection Lemma, this work presents a new solution to a class of state-feedback control problems, in which the controller is constrained to belong to a given linear space. We show through extensive discussion and numerical examples that our approach leads to several advantages with respect to existing methods: first, it is computationally efficient; second, it is less conservative than previous methods, since it relaxes the requirement of restricting the Lyapunov matrix to a block-diagonal form.

math.OC

Asynchronous semi-anonymous dynamics over large-scale networks

We analyze a class of stochastic processes, referred to as asynchronous and semi-anonymous dynamics (ASD), over directed labeled random networks. These processes are a natural tool to describe general best-response and noisy best-response dynamics in network games where each agent, at random times governed by independent Poisson clocks, can choose among a finite set of actions. The payoff is determined by the relative popularity of different actions among neighbors, while being independent of the specific identities of neighbors. Using a mean-field approach, we prove that, under certain conditions on the network and initial node configuration, the evolution of ASD can be approximated, in the limit of large network sizes, by the solution of a system of non-linear ordinary differential equations. Our framework is very general and applies to a large class of graph ensembles for which the typical random graph locally behaves like a tree. In particular, we will focus on labeled configuration-model random graphs, a generalization of the traditional configuration model which allows different classes of nodes to be mixed together in the network, permitting us, for example, to incorporate a community structure in the system. Our analysis also applies to configuration-model graphs having a power-law degree distribution, an essential feature of many real systems. To demonstrate the power and flexibility of our framework, we consider several examples of dynamics belonging to our class of stochastic processes. Moreover, we illustrate by simulation the applicability of our analysis to realistic scenarios by running our example dynamics over a real social network graph.

cs.SI

Learning hidden influences in large-scale dynamical social networks: A data-driven sparsity-based approach

Interpersonal influence estimation from empirical data is a central challenge in the study of social structures and dynamics. Opinion dynamics theory is a young interdisciplinary science that studies opinion formation in social networks and has a huge potential in applications, such as marketing, advertisement and recommendations. The term social influence refers to the behavioral change of individuals due to the interactions with others in a social system, e.g. organization, community, or society in general. The advent of the Internet has made a huge volume of data easily available that can be used to measure social influence over large populations. Here, we aim at qualitatively and quantitatively infer social influence from data using a systems and control viewpoint. First, we introduce some definitions and models of opinions dynamics and review some structural constraints of online social networks, based on the notion of sparsity. Then, we review the main approaches to infer the network's structure from a set of observed data. Finally, we present some algorithms that exploit the introduced models and structural constraints, focusing on the sample complexity and computational requirements.

eess.SY

Analysis of SparseHash: an efficient embedding of set-similarity via sparse projections

Embeddings provide compact representations of signals in order to perform efficient inference in a wide variety of tasks. In particular, random projections are common tools to construct Euclidean distance-preserving embeddings, while hashing techniques are extensively used to embed set-similarity metrics, such as the Jaccard coefficient. In this letter, we theoretically prove that a class of random projections based on sparse matrices, called SparseHash, can preserve the Jaccard coefficient between the supports of sparse signals, which can be used to estimate set similarities. Moreover, besides the analysis, we provide an efficient implementation and we test the performance in several numerical experiments, both on synthetic and real datasets.

cs.DS

Learning Political DNA in the Italian Senate

Motivated by the increasing interest of the control community towards social sciences and the study of opinion formation and belief systems, in this paper we address the problem of exploiting voting data for inferring the underlying affinity of individuals to competing ideology groups. In particular, we mine key voting records of the Italian Senate during the XVII legislature, in order to extract the hidden information about the closeness of senators to political parties, based on a parsimonious feature extraction method that selects the most relevant bills. Modeling the voting data as outcomes of a mixture of random variables and using sparse learning techniques, we cast the problem in a probabilistic framework and derive an information theoretic measure, which we refer to as Political Data-aNalytic Affinity (Political DNA). The advantages of this new affinity measure are discussed in the paper. The results of the numerical analysis on voting data unveil underlying relationships among political exponents of the Italian Senate.

cs.SI