Wilbert Samuel Rossi
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
Wilbert Samuel Rossi has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Paolo Frasca
CNRS, Inria, Grenoble INP, GIPSA-lab, University Grenoble Alpes, Grenoble, France
17 shared publications Fabio Fagnani
Dipartimento di Scienze Matematiche, Politecnico di Torino, Torino, Italy
4 shared publications- Fabio Fagnani
Department of Mathematical Sciences "G.L. Lagrange " Politecnico di Torino 10129 Torino Italy
4 shared publications - Francesca Ceragioli
Politecnico di Torino
2 shared publications - Giacomo Como
Department of Mathematical Sciences, Politecnico di Torino, Turin, Italy
2 shared publications - Frans Bianchi
Faculty of Science and Engineering, University of Groningen, Groningen, The Netherlands
1 shared publication
Latest Publications
- Open Access
- 21 October 2026
- Published by JOTE Publishers in Journal of Trial and Error
Open Educational Resources as Enabling Conditions for Student Resilience to Failure and Uncertainty
As today's scientific challenges become increasingly complex and interdisciplinary, future researchers in the fields of Science, Technology, Engineering and Mathematics (STEM) need both disciplinary skills and adaptive resilience to persevere and cope productively with failure. We argue that Open Educational Resources (OER) provide the enabling conditions for this resilience. OER are freely accessible and openly licensed materials that can be reused, adapted, and redistributed without cost barriers. In comparison to closed educational resources, OER provide greater flexibility in learning by enabling students to access a broader range of materials beyond a single prescribed textbook, work at their own pace, and revisit or compare content as needed. Such flexibility may reduce learning-related anxiety and foster persistence when facing academic difficulty. Drawing on resilience theory (e.g., Dweck's growth mindset, Henry et al.'s FAIL framework) and experiences from the Community of Practice “Innovation in STEM Education” (University of Groningen, Netherlands), this paper explores how OER's unique characteristics such as their adaptability, accessibility, and diversity of materials serve as enabling conditions that foster students' tolerance of failure and uncertainty. This approach allows us to contribute to both the theoretical understanding of resilience in STEM and its practical implementation through use of OER.
- 21 October 2026
- Published by JOTE Publishers in Journal of Trial and Error
Open AccessOpen Educational Resources as Enabling Conditions for Student Resilience to Failure and Uncertainty
As today's scientific challenges become increasingly complex and interdisciplinary, future researchers in the fields of Science, Technology, Engineering and Mathematics (STEM) need both disciplinary skills and adaptive resilience to persevere and cope productively with failure. We argue that Open Educational Resources (OER) provide the enabling conditions for this resilience. OER are freely accessible and openly licensed materials that can be reused, adapted, and redistributed without cost barriers. In comparison to closed educational resources, OER provide greater flexibility in learning by enabling students to access a broader range of materials beyond a single prescribed textbook, work at their own pace, and revisit or compare content as needed. Such flexibility may reduce learning-related anxiety and foster persistence when facing academic difficulty. Drawing on resilience theory (e.g., Dweck's growth mindset, Henry et al.'s FAIL framework) and experiences from the Community of Practice “Innovation in STEM Education” (University of Groningen, Netherlands), this paper explores how OER's unique characteristics such as their adaptability, accessibility, and diversity of materials serve as enabling conditions that foster students' tolerance of failure and uncertainty. This approach allows us to contribute to both the theoretical understanding of resilience in STEM and its practical implementation through use of OER.
- Open Access
- 17 September 2021
- Published by Springer Nature
- p. 272-281
Modeling Limited Attention in Opinion Dynamics by Topological Interactions
- 17 September 2021
- Published by Springer Nature
- p. 272-281
Open AccessModeling Limited Attention in Opinion Dynamics by Topological Interactions
- 18 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (3) , 1092-1103
The Closed Loop Between Opinion Formation and Personalized Recommendations
In online platforms, recommender systems are responsible for directing users to relevant content. In order to enhance the users’ engagement, recommender systems adapt their output to the reactions of the users, who are, in turn, affected by the recommended content. In this article, we study a tractable analytical model of a user that interacts with an online news aggregator, with the purpose of making explicit the feedback loop between the evolution of the user’s opinion and the personalized recommendation of content. More specifically, we assume that the user is endowed with a scalar opinion about a certain issue and receives news about it from a news aggregator: her opinion is influenced by all received pieces of news, which are characterized by a binary position on the issue at hand. The user is affected by a confirmation bias, that is, a preference for news that confirms her current opinion. The news aggregator recommends items with the goal of maximizing the number of user’s clicks (as a measure of her engagement): in order to fulfill its goal, the recommender has to compromise between exploring the user’s preferences and exploiting what it has learned so far. After defining suitable metrics for the effectiveness of the recommender systems (such as the click-through rate) and for its impact on the opinion, we perform both extensive numerical simulations and a mathematical analysis of the model. We find that personalized recommendations markedly affect the evolution of opinions and favor the emergence of more extreme ones: the intensity of these effects is inherently related to the effectiveness of the recommender. We also show that by tuning the amount of randomness in the recommendation algorithm, one can seek a balance between the effectiveness of the recommendation system and its impact on the opinions.
- 18 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (3) , 1092-1103
The Closed Loop Between Opinion Formation and Personalized Recommendations
In online platforms, recommender systems are responsible for directing users to relevant content. In order to enhance the users’ engagement, recommender systems adapt their output to the reactions of the users, who are, in turn, affected by the recommended content. In this article, we study a tractable analytical model of a user that interacts with an online news aggregator, with the purpose of making explicit the feedback loop between the evolution of the user’s opinion and the personalized recommendation of content. More specifically, we assume that the user is endowed with a scalar opinion about a certain issue and receives news about it from a news aggregator: her opinion is influenced by all received pieces of news, which are characterized by a binary position on the issue at hand. The user is affected by a confirmation bias, that is, a preference for news that confirms her current opinion. The news aggregator recommends items with the goal of maximizing the number of user’s clicks (as a measure of her engagement): in order to fulfill its goal, the recommender has to compromise between exploring the user’s preferences and exploiting what it has learned so far. After defining suitable metrics for the effectiveness of the recommender systems (such as the click-through rate) and for its impact on the opinion, we perform both extensive numerical simulations and a mathematical analysis of the model. We find that personalized recommendations markedly affect the evolution of opinions and favor the emergence of more extreme ones: the intensity of these effects is inherently related to the effectiveness of the recommender. We also show that by tuning the amount of randomness in the recommendation algorithm, one can seek a balance between the effectiveness of the recommendation system and its impact on the opinions.
- Open Access
Modeling limited attention in opinion dynamics by topological interactions
This work explores models of opinion dynamics with opinion-dependent connectivity. Our starting point is that individuals have limited capabilities to engage in interactions with their peers. Motivated by this observation, we propose a continuous-time opinion dynamics model such that interactions take place with a limited number of peers: we refer to these interactions as topological, as opposed to metric interactions that are postulated in classical bounded-confidence models. We observe that topological interactions produce equilibria that are very robust to perturbations.
Open AccessModeling limited attention in opinion dynamics by topological interactions
This work explores models of opinion dynamics with opinion-dependent connectivity. Our starting point is that individuals have limited capabilities to engage in interactions with their peers. Motivated by this observation, we propose a continuous-time opinion dynamics model such that interactions take place with a limited number of peers: we refer to these interactions as topological, as opposed to metric interactions that are postulated in classical bounded-confidence models. We observe that topological interactions produce equilibria that are very robust to perturbations.
- 19 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 4 (3) , 566-571
Opinion Dynamics With Topological Gossiping: Asynchronous Updates Under Limited Attention
This paper introduces a general model of opinion dynamics with opinion-dependent connectivity. Agents update their opinions asynchronously: for the updating agent, the new opinion is the average of the k closest opinions within a subset of m agents that are sampled from the population of size n. Depending on k and m with respect to n, the dynamics can have a variety of equilibria, which include consensus and clustered configurations. The model covers as special cases a classical gossip update (if m=n) and a deterministic update defined by the k nearest neighbors (if m=k). We prove that the dynamics converges to consensus if n>2(m-k). Before convergence, however, the dynamics can remain for long time in the vicinity of metastable clustered configurations.
- 19 February 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 4 (3) , 566-571
Opinion Dynamics With Topological Gossiping: Asynchronous Updates Under Limited Attention
This paper introduces a general model of opinion dynamics with opinion-dependent connectivity. Agents update their opinions asynchronously: for the updating agent, the new opinion is the average of the k closest opinions within a subset of m agents that are sampled from the population of size n. Depending on k and m with respect to n, the dynamics can have a variety of equilibria, which include consensus and clustered configurations. The model covers as special cases a classical gossip update (if m=n) and a deterministic update defined by the k nearest neighbors (if m=k). We prove that the dynamics converges to consensus if n>2(m-k). Before convergence, however, the dynamics can remain for long time in the vicinity of metastable clustered configurations.
- Open Access
The closed loop between opinion formation and personalised recommendations
In online platforms, recommender systems are responsible for directing users to relevant contents. In order to enhance the users' engagement, recommender systems adapt their output to the reactions of the users, who are in turn affected by the recommended contents. In this work, we study a tractable analytical model of a user that interacts with an online news aggregator, with the purpose of making explicit the feedback loop between the evolution of the user's opinion and the personalised recommendation of contents. More specifically, we assume that the user is endowed with a scalar opinion about a certain issue and seeks news about it on a news aggregator: this opinion is influenced by all received news, which are characterized by a binary position on the issue at hand. The user is affected by a confirmation bias, that is, a preference for news that confirm her current opinion. The news aggregator recommends items with the goal of maximizing the number of user's clicks (as a measure of her engagement): in order to fulfil its goal, the recommender has to compromise between exploring the user's preferences and exploiting what it has learned so far. After defining suitable metrics for the effectiveness of the recommender systems (such as the click-through rate) and for its impact on the opinion, we perform both extensive numerical simulations and a mathematical analysis of the model. We find that personalised recommendations markedly affect the evolution of opinions and favor the emergence of more extreme ones: the intensity of these effects is inherently related to the effectiveness of the recommender. We also show that by tuning the amount of randomness in the recommendation algorithm, one can seek a balance between the effectiveness of the recommendation system and its impact on the opinions.
Open AccessThe closed loop between opinion formation and personalised recommendations
In online platforms, recommender systems are responsible for directing users to relevant contents. In order to enhance the users' engagement, recommender systems adapt their output to the reactions of the users, who are in turn affected by the recommended contents. In this work, we study a tractable analytical model of a user that interacts with an online news aggregator, with the purpose of making explicit the feedback loop between the evolution of the user's opinion and the personalised recommendation of contents. More specifically, we assume that the user is endowed with a scalar opinion about a certain issue and seeks news about it on a news aggregator: this opinion is influenced by all received news, which are characterized by a binary position on the issue at hand. The user is affected by a confirmation bias, that is, a preference for news that confirm her current opinion. The news aggregator recommends items with the goal of maximizing the number of user's clicks (as a measure of her engagement): in order to fulfil its goal, the recommender has to compromise between exploring the user's preferences and exploiting what it has learned so far. After defining suitable metrics for the effectiveness of the recommender systems (such as the click-through rate) and for its impact on the opinion, we perform both extensive numerical simulations and a mathematical analysis of the model. We find that personalised recommendations markedly affect the evolution of opinions and favor the emergence of more extreme ones: the intensity of these effects is inherently related to the effectiveness of the recommender. We also show that by tuning the amount of randomness in the recommendation algorithm, one can seek a balance between the effectiveness of the recommendation system and its impact on the opinions.
- Open Access
Asynchronous opinion dynamics on the $k$-nearest-neighbors graph
This paper is about a new model of opinion dynamics with opinion-dependent connectivity. We assume that agents update their opinions asynchronously and that each agent's new opinion depends on the opinions of the $k$ agents that are closest to it. We show that the resulting dynamics is substantially different from comparable models in the literature, such as bounded-confidence models. We study the equilibria of the dynamics, observing that they are robust to perturbations caused by the introduction of new agents. We also prove that if the number of agents $n$ is smaller than $2k$, the dynamics converge to consensus. This condition is only sufficient.Open AccessAsynchronous opinion dynamics on the $k$-nearest-neighbors graph
This paper is about a new model of opinion dynamics with opinion-dependent connectivity. We assume that agents update their opinions asynchronously and that each agent's new opinion depends on the opinions of the $k$ agents that are closest to it. We show that the resulting dynamics is substantially different from comparable models in the literature, such as bounded-confidence models. We study the equilibria of the dynamics, observing that they are robust to perturbations caused by the introduction of new agents. We also prove that if the number of agents $n$ is smaller than $2k$, the dynamics converge to consensus. This condition is only sufficient. - Open Access
Effects of Network Communities and Topology Changes in Message-Passing Computation of Harmonic Influence in Social Networks
The harmonic influence is a measure of the importance of nodes in social networks, which can be approximately computed by a distributed message-passing algorithm. In this extended abstract we look at two open questions about this algorithm. How does it perform on real social networks, which have complex topologies structured in communities? How does it perform when the network topology changes while the algorithm is running? We answer these two questions by numerical experiments on a Facebook ego network and on synthetic networks, respectively. We find out that communities can introduce artefacts in the final approximation and cause the algorithm to overestimate the importance of "local leaders" within communities. We also observe that the algorithm is able to adapt smoothly to changes in the topology.
Open AccessEffects of Network Communities and Topology Changes in Message-Passing Computation of Harmonic Influence in Social Networks
The harmonic influence is a measure of the importance of nodes in social networks, which can be approximately computed by a distributed message-passing algorithm. In this extended abstract we look at two open questions about this algorithm. How does it perform on real social networks, which have complex topologies structured in communities? How does it perform when the network topology changes while the algorithm is running? We answer these two questions by numerical experiments on a Facebook ego network and on synthetic networks, respectively. We find out that communities can introduce artefacts in the final approximation and cause the algorithm to overestimate the importance of "local leaders" within communities. We also observe that the algorithm is able to adapt smoothly to changes in the topology.
- 12 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (2) , 116-129
On the Convergence of Message Passing Computation of Harmonic Influence in Social Networks
The harmonic influence is a measure of node influence in social networks that quantifies the ability of a leader node to alter the average opinion of the network, acting against an adversary field node. The definition of harmonic influence assumes linear interactions between the nodes described by an undirected weighted graph; its computation is equivalent to solve a discrete Dirichlet problem associated to a grounded Laplacian for every node. This measure has been recently studied, under slightly more restrictive assumptions, by Vassio et al., IEEE Trans. Control Netw. Syst., 2014, who proposed a distributed message passing algorithm that concurrently computes the harmonic influence of all nodes. In this paper, we provide a convergence analysis for this algorithm, which largely extends upon previous results: we prove that the algorithm converges asymptotically, under the only assumption of the interaction Laplacian being symmetric. However, the convergence value does not in general coincide with the harmonic influence: by simulations, we show that when the network has a larger number of cycles, the algorithm becomes slower and less accurate, but nevertheless provides a useful approximation. Simulations also indicate that the symmetry condition is not necessary for convergence and that performance scales very well in the number of nodes of the graph.
- 12 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (2) , 116-129
On the Convergence of Message Passing Computation of Harmonic Influence in Social Networks
The harmonic influence is a measure of node influence in social networks that quantifies the ability of a leader node to alter the average opinion of the network, acting against an adversary field node. The definition of harmonic influence assumes linear interactions between the nodes described by an undirected weighted graph; its computation is equivalent to solve a discrete Dirichlet problem associated to a grounded Laplacian for every node. This measure has been recently studied, under slightly more restrictive assumptions, by Vassio et al., IEEE Trans. Control Netw. Syst., 2014, who proposed a distributed message passing algorithm that concurrently computes the harmonic influence of all nodes. In this paper, we provide a convergence analysis for this algorithm, which largely extends upon previous results: we prove that the algorithm converges asymptotically, under the only assumption of the interaction Laplacian being symmetric. However, the convergence value does not in general coincide with the harmonic influence: by simulations, we show that when the network has a larger number of cycles, the algorithm becomes slower and less accurate, but nevertheless provides a useful approximation. Simulations also indicate that the symmetry condition is not necessary for convergence and that performance scales very well in the number of nodes of the graph.
- 27 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (2) , 158-172
Threshold Models of Cascades in Large-Scale Networks
The spread of new beliefs, behaviors, and technologies in social and economic networks are often driven by cascading mechanisms. Global behaviors emerge from the interplay between the interconnections structure and the local agents interactions. We focus on the Threshold Model (TM) of cascades that can be interpreted as the best response dynamics in a network game. Each agent is equipped with an individual threshold representing the number of her neighbors who must have adopted a certain action for that to become the agent's best response. We analyze the TM dynamics on large-scale networks with heterogeneous agents. Through a local mean-field approach, we obtain a nonlinear, one-dimensional, recursive equation that approximates the TM's evolution on most of the networks of a given size and distribution of degrees and thresholds. Specifically, we prove that, on all but a fraction of networks with given degree and threshold statistics that is vanishing as the network size grows large, the actual fraction of adopters of a given action in the TM dynamics is arbitrarily close to the output of the aforementioned recursion. Finally, we analyze the dynamic behavior and bifurcations of this recursion and complement the predictions with numerical simulations on real network testbeds.
- 27 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 6 (2) , 158-172
Threshold Models of Cascades in Large-Scale Networks
The spread of new beliefs, behaviors, and technologies in social and economic networks are often driven by cascading mechanisms. Global behaviors emerge from the interplay between the interconnections structure and the local agents interactions. We focus on the Threshold Model (TM) of cascades that can be interpreted as the best response dynamics in a network game. Each agent is equipped with an individual threshold representing the number of her neighbors who must have adopted a certain action for that to become the agent's best response. We analyze the TM dynamics on large-scale networks with heterogeneous agents. Through a local mean-field approach, we obtain a nonlinear, one-dimensional, recursive equation that approximates the TM's evolution on most of the networks of a given size and distribution of degrees and thresholds. Specifically, we prove that, on all but a fraction of networks with given degree and threshold statistics that is vanishing as the network size grows large, the actual fraction of adopters of a given action in the TM dynamics is arbitrarily close to the output of the aforementioned recursion. Finally, we analyze the dynamic behavior and bifurcations of this recursion and complement the predictions with numerical simulations on real network testbeds.