1. Introduction
The study of social phenomena through mathematical modelling has gained significant attention in the scientific community, especially in recent decades [Reference Bellomo, Ajmone Marsan and Tosin6, Reference Castellano, Fortunato and Loreto17, Reference Galam28, Reference Motsch and Tadmor35, Reference Naldi, Pareschi and Toscani37, Reference Pareschi and Toscani41, Reference Strogatz50]. The exchange of information on these platforms has sparked research in understanding how social interactions shape the process of opinion formation [Reference Albi, Pareschi, Toscani, Zanella, Bellomo, Degond and Tadmor3, Reference Ben-Naim7, Reference Borra and Lorenzi10, Reference Klein, Ahlf and Sharma30, Reference Lavenant and Maury33, Reference Slanina and Lavička48, Reference Sznajd-Weron and Sznajd51, Reference Yardi, Romero, Schoenebeck and boyd57].
In social interactions, the relationships between individuals are often structured as networks that co-evolve with the individuals themselves [Reference Thurner, Klimek and Hanel49]. A prominent example of this is the formation of opinions or norms within social networks, where interactions only occur between connected agents. However, the network connections are dynamic, and this change influences the states of the individuals. For example, opinions can be influenced by connections, such as followers reacting to posts, while individuals tend to follow others with closer opinions.
The network structure of social interactions plays a vital role and is commonly represented using random networks. However, there are two natural levels in examining opinion formation processes on network: the microscopic and macroscopic scales. The microscopic models have been employed to simulate phenomena such as opinion formation, knowledge networks, social norm formation and biological transport networks [Reference Albi, Pareschi and Zanella1, Reference Albi, Burger, Haskovec, Markowich and Schlottbom2, Reference Benatti, de Arruda, Silva, Comin and da Fontoura Costa8, Reference Kohne, Gallagher, Kirgil, Paolillo, Padmos and Karimi31, Reference Nigam, Shin, Bahulkar, Hooi, Hachen, Szymanski, Faloutsos and Chawla39, Reference Tur and Azagra-Caro54]. In considering processes with a huge number of agents, a natural question arises in considering a limit procedure between the two scales. However, the specific details of the network structure can be lost, and only few general characteristics are incorporated into the models [Reference Coppini, Dietert and Giacomin19, Reference Delattre, Giacomin and Lucon20].
From a mathematical standpoint, it is natural to apply methods from statistical physics or kinetic theory to bridge the gap between microscopic interactions and macroscopic models, see [Reference Boudin and Salvarani12, Reference Toscani52]. This approach involves formulating partial differential equations for distributions and using well-established asymptotic methods to simplify the equations and analyse pattern formation [Reference Bouchut, Golse and Pulvirenti11, Reference Cercignani18]. These mathematical approaches have successfully explained macroscopic distributions in socio-economic interactions and various aspects of opinion formation and polarisation [Reference Albi, Pareschi, Toscani, Zanella, Bellomo, Degond and Tadmor3, Reference Burger, Caffarelli and Markowich15, Reference Naldi, Pareschi and Toscani36, Reference Pareschi and Toscani42]. Using these tools has significantly contributed to understanding the emergence of macroscopic behaviour from microscopic interactions in a wide range of social phenomena.
1.1. Modelling motivation: the social context
During the last two decades, the diffusion of smartphones and the increasing use of social networks have changed how people interact and form their beliefs. There are two main aspects that have been drastically disrupted: the number of connections and the frequency of interactions.
Due to the hyperconnectivity of the globalised world, each individual can get in contact with a wide range of opinions. Delocalising the place of interaction from physical space to the digital realm has destroyed the local cultural bias of interactions. This implies that each individual can come into contact with cultures and ideas they do not know and cannot deeply understand. This aspect has resulted in a change in the epistemic processes, specifically altering the dynamics that govern the formation of beliefs when individuals are exposed to new inputs (news, visual art, songs, posts, tweets, chats, etc.).
Moreover, the increasing amount of inputs and their high frequency create a physical upper bound on the processing capacity of the human brain. An individual walking through a mall cannot process all the inputs coming from screens, speakers, billboards, smartphones and so on. The same situation occurs while scrolling through social networks or digital social media. As a result, there is a need to filter the inputs, both on the physical side through the network and on the rational side, by selectively processing only a few of them and disregarding others at a peripheral level of thinking.
All these aspects are well understood by scientists from social sciences and social epistemologists (a non-exhaustive list includes references such as [Reference Begby5, Reference Bernecker9, Reference Lackey32, Reference Thi Nguyen38, Reference Rosenstock, Bruner and O’Connor44, Reference Weatherall and O’Connor56]). However, it is challenging to fit them into a unified mathematical description. In this paper, we propose an approach that mainly focuses on two tools: attitude areas and the Euclidean network. In Section 4, we introduce and simulate a new model to investigate the evolution of the network and opinion distributions for agents interacting on social networks and social media.
1.2. Modelling tools
We consider a generalisation of the model introduced by Burger in [Reference Burger13, Reference Burger14]. In these works, the author derives a kinetic description of an opinion formation process on networks. Inspired by these studies, we associate two variables with each individual: the network position and the opinion distribution.
Opinion Distribution
The description of an individual’s opinion during the opinion formation process can be represented by a distribution rather than a single value. The motivation lies in the fact that an individual may be indecisive, lacking a clear and definite opinion. Instead, their thoughts span multiple possibilities. An example can be related to political elections, where voters loyal to smaller parties often face the dilemma of the strategic vote. This term refers to the choice of voting for a party other than their own, typically one similar but with a higher chance of surpassing the threshold percentage. In such a case, the individual’s opinion is described by a distribution with two peaks, one at the position of their affiliated party and another at the position associated with the strategic vote. Now, let’s consider a finite population $\mathcal{M} = \{1, \ldots, M\in \mathbb{N}\}$ with $M$ individuals. To each individual, we associate a distribution $\rho ^{\mathcal{i}}\,{:}\,(x,t)\in \Omega \times [0,\infty )\to [0,\infty )$ , where $\mathcal{i} \in \mathcal{M}$ and $\Omega \in \mathbb{R}$ is bounded.
The Social Strength
Every individual possesses a distinct social strength denoted as $\sigma ^{\mathcal{i}}$ . This corresponds to the integral of their opinion, i.e. $\sigma ^{\mathcal{i}} = \int _\Omega \rho ^{\mathcal{i}}(y) \, dy$ . Mathematically, this quantity coincides with mass. However, from a modelling perspective, it represents an individual’s inclination to uphold their own opinion. In the scenario of an attractive binary interaction between two agents with different social strengths, the average of their opinions tends to align more closely with the original opinion of the agent with the higher social strength. Conversely, in the case of a repulsive interaction, the agent with the lower social strength will deviate further from the average of the original opinions.
Euclidean Network
The network position is described by the function $a^{\mathcal{i}}\,{:}\,t\in [0,\infty )\to \mathbb{R}^2$ with $\mathcal{i} \in \mathcal{M}$ . In this way, the network is based on a Euclidean space and its natural distance. Instead of considering interactions mediated by weights between individuals $\mathcal{i}$ and $\mathcal{j}$ , we use their distance in $\mathbb{R}^2$ . This has a direct consequence on the modelling interpretation of interactions. Specifically, cases are excluded where two agents are close, but a third agent is close to one but not the other. If we take three individuals $\mathcal{i}$ , $\mathcal{j}$ and $\mathcal{k}$ in $\mathcal{M}$ , then if $\mathcal{i}$ is close to $\mathcal{j}$ , it implies that $\mathcal{k}$ cannot be distant from one but close to the other.
The PDE-ODE System
The model under consideration describes the temporal evolution of the opinion distribution and the network position of each agent. Given the vectors of positions $\mathbf{a}$ and opinion distributions $\boldsymbol{\rho }$ , their evolution is described by the following system:
where $\beta ^{\mathcal{i}}$ and $\theta ^{\mathcal{i}}$ are defined by:
where $\mathbf{A}^{\mathcal{ij}}$ and $\mathbf{K}^{\mathcal{ij}}$ are interaction potentials, to be defined later. In (1.1), $\mu _{\rho ^{\mathcal{i}}}$ indicates the mean of $\rho ^{\mathcal{i}}$ . The term $a^{\mathcal{ij}}$ represents the Euclidean distance between agents $\mathcal{i}$ and $\mathcal{j}$ in the network space, i.e. $a^{\mathcal{ij}} = \mid a^{\mathcal{i}} - a^{\mathcal{j}}\mid$ , coinciding with $a^{\mathcal{ji}}$ by construction. In (1.1) we are not imposing boundary conditions. However, we are interested in the case where individual opinions do not exit the considered interval. We will take care of the proper boundary conditions to be imposed on (1.1) in the following.
The Interaction Potentials: Diffusion Mobility and Transport
The operators $\beta ^{\mathcal{i}}$ and $\theta ^{\mathcal{i}}$ appearing in the evolution of the opinion distribution are related to the terms of diffusion mobility and transport, respectively. The resulting equation combines these terms in an aggregation-diffusion manner. Both operators have a nonlocal nature. The diffusion mobility term depends on the vector $\boldsymbol{\rho }$ and introduces a cross-diffusion mechanism affecting the system’s opinion evolution. The terms $\mathbf{A}^{\mathcal{ij}}$ and $\mathbf{K}^{\mathcal{ij}}$ represent the interaction kernels, applicable to both social networks and social media descriptions. Importantly, they depend on both the distance between opinions and the distance between agents in the network space.
In Section 4, we define the kernels explicitly and we give the interpretation in relation to social network’s and social media’s structures.
Furthermore, if $\beta ^{\mathcal{i}} \equiv 1$ in (1.1) for all $\mathcal{i}$ , the diffusion terms become a one-dimensional Laplacian. The natural question is whether we can consider more general types of nonlinear (possibly degenerate) diffusion. In what follows, we consider the general diffusion terms below
Here, $\Phi ^{\mathcal{i}}$ represents nonlinear functions, refer to hypothesis (Diff) below for a precise statement. The minimal assumptions on $\Phi ^{\mathcal{i}}$ include Lipschitz regularity and nondecreasing monotonicity. This class of diffusion includes the classical porous medium equations (one-point degeneracy), the two-phase reservoir flow equations (two-point degeneracy) and the so-called strongly degenerate diffusion equations where $\Phi ^{\mathcal{i}}(s)=0$ for $s \in [s_1, s_2]$ .
1.3. The goal of the model
This model aims to describe common and general phenomena emerging in the last two decades due to the increasingly widespread use of social networks and social media. Specifically, it focuses on the changes in the epistemic process caused by such technology. Through the DPA scheme and numerical simulations, we aim to observe the segregation of the population or network into distinct opinion bubbles. Additionally, maintaining a highly general model based on attraction and repulsion principles, we aim to observe the radicalisation and polarisation of opinions based on network connectivity. In other words, we seek to examine the tendency of the hyperconnected society towards a more polarised distribution of opinions and a network divided into large opinion clusters.
Polarisation, Radicalisation and Segregation
Polarisation is the inclination of an individual or a group of individuals to adopt very extreme opinions, generally in stark opposition to the majority who do not share the same opinion. Another phenomenon often confused with polarisation is radicalisation. Radicalisation involves the tendency to become more entrenched in one’s opinion and less prone to change. For example, a highly radicalised person is not subject to polarisation, but what often happens is that polarisation occurs first, followed by radicalisation, leading to the creation of extremist groups. Segregation, on the other hand, is not related to opinion but to the network. In this work, segregation refers to the tendency of the network to develop groups that share the same opinion. However, it is important to note that sharing the same opinion does not imply belonging to the same group since the network can split into multiple opinion balls not connected in terms of interactions.
Observing these phenomena without imposing them from a modelling perspective but maintaining a very general description based on the epistemic process of the individual rather than population behaviour is the applied goal of this work.
1.4. Structure and results
The paper pursues a dual objective. Firstly, we aim to establish the existence of solutions for the system (1.1) within an appropriate functional framework. Secondly, we seek to numerically investigate solutions to the system in order to determine its ability to replicate processes such as polarisation, radicalisation, fragmentation and clustering of the population. Similar inquiries have been recently explored in [Reference Nugent, Gomes and Wolfram40].
To establish the existence of solutions for system (1.1), we draw inspiration from the deterministic particle approximation (DPA) developed for similar equations in [Reference Fagioli and Radici25–Reference Fagioli and Tse27]. The method, along with its various modifications, traces back to seminal works [Reference Gosse and Toscani29, Reference Russo46]. It demonstrates the convergence of the resulting equation and has been applied in various contexts such as traffic flow [Reference Di Francesco, Fagioli and Rosini22, Reference Di Francesco and Rosini23] and local or nonlocal transport equations [Reference Di Francesco, Fagioli and Radici21, Reference Di Francesco and Stivaletta24, Reference Fagioli and Tse27].
The DPA is then employed for numerical simulations of (1.1). While the numerical scheme can be connected to moving mesh schemes applied in diverse contexts, its limitations should be acknowledged, especially in one-dimensional applications.
The paper is organised as follows. In Section 2, we introduce the rigorous Deterministic Particle Approximation (DPA). Preliminaries on optimal transportation theory are presented along with the main assumptions. The section concludes with the statement of the main result in Theorem 2.2. Section 3 focuses on the proof of the main theorem by providing fundamental a priori estimates, allowing the deduction of convergence of properly reconstructed piecewise constant densities to weak solutions. Finally, in Section 4, we utilise the DPA numerical scheme to simulate an explicit model for opinion formation on an evolving network. The goal is to study radicalisation, polarisation and fragmentation of the population while altering its open-mindedness and the radius of interaction.
2. Rigorous formulation, assumptions and main result
2.1. Deterministic Particle Approximation (DPA)
We begin this section with the rigorous formulation of the particle evolution already sketched in the Introduction. We consider in $\mathbb{R}^d$ a network of $M$ nodes and we locate an agent $a^{\mathcal{i}}\in \mathbb{R}^d$ with $\mathcal{i}\in \mathcal{M}=\{1,\ldots,M\}$ in each node. Assume that each agent may have opinion ranging on a compact set $\Omega \subset \mathbb{R}$ , without loss of generality we consider $\Omega = [{-}1,1]$ . To each agent we associate a finite opinion strength $\sigma ^{\mathcal{i}}$ and an initial opinion density $\bar{\rho }^{\mathcal{i}}(x)\in L^1(\Omega )$ such that
Given $N\in \mathbb{N}$ , we consider the strength fractions $\sigma ^{\mathcal{i}}_N = \sigma ^{\mathcal{i}}/ N$ , and we introduce for each $\mathcal{i} \in \mathcal{M}$ the $\{\bar{x}_k^{\mathcal{i}}\}$ partition of $\Omega$ with $k\in \mathcal{N}=\{0,\ldots,N\}$ given by
Note that $\bar{x}_k^{\mathcal{i}}\lt \bar{x}_{k+1}^{\mathcal{i}}$ , for any $\mathcal{i}\in \mathcal{M}$ and $k\in \mathcal{N}\setminus \left \{N\right \}$ . This procedure allows to associate with each agent a finite number of time-evolving opinions $x^{\mathcal{i}}_k(t)$ . Assume that initially all the nodes $\bar{a}^{\mathcal{i}} = a^{\mathcal{i}}(t=0)$ are located in a certain smooth and bounded domain $\Lambda \in \mathbb{R}^d$ . We then let the nodes evolve in time depending on the distances $a^{\mathcal{ij}}$ between the agents $a^{\mathcal{i}}$ and $a^{\mathcal{j}}$ and the mean opinion of the agents.
We define the discrete opinion densities for the $\mathcal{i}$ -th agent as
with $k\in \mathcal{N}\setminus \left \{N\right \}$ , and the discrete mean opinions by
where $a^{\mathcal{ij}}_{\mathcal{N}}$ is the Euclidean distance between the agents after the opinion discretisation. In the following, we may denote with $\textbf{x}^{\mathcal{i},\mathcal{N}}(t)\,:\!=\left (x_0^{\mathcal{i}}(t),\ldots,x_N^{\mathcal{i}}(t)\right )$ , for all $\mathcal{i}\in \mathcal{M}$ .
Thus, we consider the following system of ODEs
for $k\in \mathcal{N}\setminus \left \{0,N\right \}$ and $\mathcal{i} \in \mathcal{M}$ , endowed with the boundary conditions
and initial conditions
In (2.4), we have denoted with $\beta ^{\mathcal{i}}_k(t)$ the discrete diffusion mobilities
and with $\Phi ^{\mathcal{i}}$ the nonlinear diffusion for the agent $\mathcal{i}$ , see assumption (Dif) below. The contribution of the diffusion at the particle level can be interpreted assuming that opinions evolve with a speed equal to the osmotic velocity associated with the diffusion process, see [Reference Fagioli and Radici25, Reference Fagioli and Radici26, Reference Russo46].
Functions $\theta ^{\mathcal{i}}_k(t)$ describe the discrete transports and are given by
We briefly comment on the boundary conditions in (2.5). As mentioned earlier, in (1.1) we did not introduce any boundary conditions. However, we are interested in the case where individual opinions do not exit the considered interval. Condition (2.5) enforces zero velocity for extreme opinions, which, along with the results of Lemma 3.2 on the preservation of the order of opinions, implies zero-flux boundary conditions for the opinion densities, as specified in equation (2.11) below.
2.2. Preliminaries and assumptions
We now present some tools from optimal transport that will be useful in the sequel. The Wasserstein distance is the right notion of distance for the opinions since it allows to measure the distances between measures (densities) with same mass. For a fixed mass $\sigma \gt 0$ , we consider the space
Given $\mu \in \mathfrak{M}_\sigma$ , we introduce the pseudo-inverse function $X_\mu \in L^1([0,\sigma ]\,{;}\,{\mathbb{R}})$ as
In particular, if $\sigma =1$ , then $\mathfrak{M}_1$ is the set of non-negative probability densities on $\mathbb{R}$ , and it is possible to consider the one-dimensional $1$ -Wasserstein distance between each pair of densities $\rho _1,\rho _2\in \mathfrak{M}_1$ . As shown in [Reference Carrillo and Toscani16], in the one-dimensional setting the $p$ -Wasserstein distance can be equivalently defined in terms of the $L^1$ -distance between the respective pseudo-inverse mappings as
For generic $\sigma \gt 0$ , we recall the definition for the scaled $1$ -Wasserstein distance between $\rho _1,\rho _2\in \mathfrak{M}_\sigma$ as
We refer to [Reference Ambrosio, Gigli and Savaré4, Reference Santambrogio47, Reference Villani55] for a complete presentation of the subject.
We assume that the initial densities are under the following assumptions:
-
(In1) $\bar{\rho }^{\mathcal{i}} \in BV(\Omega \,;\,{\mathbb{R}}^+)$ with $\|\bar{\rho }^{\mathcal{i}}\|_{L^1(\Omega )} = \sigma ^{\mathcal{i}}$ , for some $\sigma ^{\mathcal{i}}\gt 0$ ,
-
(In2) there exists $m^{\mathcal{i}},M^{\mathcal{i}} \gt 0$ such that $m^{\mathcal{i}} \leq \bar{\rho }^{\mathcal{i}}(x) \leq M^{\mathcal{i}}$ for every $x \in \Omega$ .
Due to technical constraints, initial data with a vacuum region cannot be considered, as evident in the proof of Proposition 3.6. The lower bound is employed to control the time derivatives of extreme opinion densities $\dot{\rho }_0^{\mathcal{i}}$ and $\dot{\rho }_N^{\mathcal{i}}$ . The essential point is the need for either a uniform control over these quantities or an estimation at an appropriate rate of $N$ . We believe that this technical issue can be resolved, especially in the case of nonlinear diffusion, where finite speed of propagation is known and not utilised in the numerical Section. However, addressing this matter is currently beyond our capabilities. We now introduce the assumptions for the diffusive and transport operators.
-
(A) We assume that ${\mathbf{A}}^{\mathcal{ij}} \,{:}\, \Omega \times \Omega \times{\mathbb{R}}\to{\mathbb{R}}$ is a $C^1$ non-negative function w.r.t. the first variable and for all pairs $(\mathcal{i},\mathcal{j})$ it exists $c_{\mathbf{A}} \gt 0$ such that
\begin{equation*} |{\mathbf {A}}^{\mathcal {ij}}(x^i_{k^*}, x^j_{s^*}, a^{\mathcal {ij}}) - {\mathbf {A}}^{\mathcal {ij}}(x^i_k, x^j_s,a^{\mathcal {ij}})| \le c_{\mathbf {A}} \left ( |x^i_{k^*} - x^i_k| + |x^j_{s^*} - x^j_s| \right )\,, \end{equation*}and it exists $c_{1,{\mathbf{A}}} \gt 0$ such that\begin{equation*} |\partial _1{\mathbf {A}}^{\mathcal {ij}}(x^i_{k^*}, x^j_{s^*}, a^{\mathcal {ij}})-\partial _1{\mathbf {A}}^{\mathcal {ij}}(x^i_k, x^j_s,a^{\mathcal {ij}})|\leq c_{1,{\mathbf {A}}}|x^j_{s^*} - x^j_s|, \end{equation*}for all $(k,k^*)$ and $(s,s^*)$ pairs of indexes in $\mathcal{N}\times \mathcal{N}$ , where $\partial _1{\mathbf{A}}^{\mathcal{ij}}$ denotes the derivatives with respect to the first entrance. -
(K) We assume that $\mathbf{K}^{\mathcal{ij}} \,{:}\, \Omega \times \Omega \times{\mathbb{R}}\to{\mathbb{R}}$ is bounded, continuous, and for all pairs $(\mathcal{i},\mathcal{j})$ , it exists $c_{\mathbf{K}} \gt 0$ such that
\begin{equation*} |\mathbf {K}^{\mathcal {ij}}(x^i_{k^*}, x^j_{s^*},a^{\mathcal {ij}}) - \mathbf {K}^{\mathcal {ij}}(x^i_k, x^j_s,a^{\mathcal {ij}})| \le c_{\mathbf {K}} \left ( |x^i_{k^*} - x^i_k| + |x^j_{s^*} - x^j_s|\right )\,, \end{equation*}for all $(k,k^*)$ and $(s,s^*)$ pairs of indexes in $\mathcal{N}\times \mathcal{N}$ . We further assume that\begin{equation*}\mathbf {K^{\mathcal {i}\mathcal {i}}}(x,x,a^{\mathcal {i}\mathcal {i}})=0.\end{equation*} -
(Dif) $\Phi ^{\mathcal{i}}\,{:}\, [0,\infty ) \to{\mathbb{R}}$ is a nondecreasing Lipschitz function, with $\Phi ^{\mathcal{i}}(0)=0$ .
-
(V) The network velocity $\mathbf{V}$ is a $C^1$ bounded function on $\Omega \times \Omega \times{\mathbb{R}}^{+}$ .
2.3. Continuous reconstruction and main result
Given the preliminary assumptions, we give the definition of weak solutions to equation (1.1) together with the statement of the main result.
By setting $\Omega _T = [0,T]\times \Omega$ and $\partial \Omega _T=[0,T]\times \left \{-1,1\right \}$ , and considering $\bar{\rho }^{\mathcal{i}}\in L^1\cap L^\infty (\Omega )$ and $\bar{a}^{\mathcal{i}}\in \Lambda \subset{\mathbb{R}}^d$ , we are going to deal with the following PDE-ODE system
for all $\mathcal{i}\in \mathcal{M}$ , where the bold notation refers to the vectors $\boldsymbol{\rho } = (\rho ^1,\ldots,\rho ^M)$ and the set $\mathbf{a}=(a^1,\ldots,a^M)$ .
We state the notion of weak solution for the system (2.11) as follows
Definition 2.1 (Weak solution). We say that the couple $\left (\boldsymbol{\rho },\mathbf{a}\right )$ is a weak solution of (1.1) in the formulation (2.11) if
-
• $\rho ^{\mathcal{i}} \in L^\infty \cap BV(\Omega _T)$ , with $\rho ^{\mathcal{i}}(0,\cdot )= \bar{\rho }^{\mathcal{i}}$ , for all $\mathcal{i}\in \mathcal{M}$
-
• $a^{\mathcal{i}}\in C^2\left (\left [0,T\right ];\,{\mathbb{R}}^d\right )$ ,
and taken $\zeta \in C_0^{\infty }(\Omega _T)$ , for all $\mathcal{i}\in \mathcal{M}$ it satisfies
and
for all $t\in [0,T]$ .
Given the discrete opinion densities defined in (2.2), we consider the following piecewise constant density reconstructions
The main result of the paper reads as follows
Theorem 2.2. Given $M\in \mathbb{N}$ and $T\gt 0$ fixed, consider ${\mathbf{a}}^{\mathcal{ij}}$ , $\mathbf{K}^{\mathcal{ij}}$ , $\mathbf{V}$ and $\Phi ^{\mathcal{i}}$ under assumptions $({\mathbf{A}})$ , $(\mathbf{K})$ , $(\textbf{V})$ and $(Dif)$ , respectively, for all $\mathcal{i},\mathcal{j}\in \mathcal{M}$ . Let $\bar{\rho }^{\mathcal{i}}\,{:}\,\Omega \to{\mathbb{R}}$ under assumptions $(In1)$ and $(In2)$ and $\bar{a}^{\mathcal{i}}\in \Lambda \subset{\mathbb{R}}^d$ for all $\mathcal{i}\in \mathcal{M}$ . Then, for all $\mathcal{i}\in \mathcal{M}$ , when $N\to \infty$ the density $\rho ^{\mathcal{i},\mathcal{N}}$ introduced in equation (2.14) converges (up to subsequence) strongly to a non-negative function $\rho ^{\mathcal{i}}\in L^\infty \cap BV (\Omega _T)$ such that $\|\rho ^{\mathcal{i}}\|=\sigma ^{\mathcal{i}}$ and the solution to equation (2.4b) $a_{\mathcal{N}}^{\mathcal{i}}$ converges to $a^{\mathcal{i}}\in C^2\left (\left [0,T\right ];\,{\mathbb{R}}^d\right )$ where the couple $\left (\boldsymbol{\rho },\mathbf{a}\right )$ is a solution to equation (1.1) in the sense of Definition 2.1 .
Note that non-negativeness of the limit functions $\rho$ easily follows by construction, see also (3.4) below, as well as the mass preservation. To avoid lack of notation, we highlight that from now on while considering the limit $N\to \infty$ we refer to the limit to infinity of the cardinality of the set of indexes $\mathcal{N}=\{0,\ldots,N\}$ .
3. Proof of the main result
3.1. Basic estimates
We start providing some fundamental estimates that allow to deduce the well-posedness of (2.4) and of the discrete densities (2.2). Let us recall that in (2.2), we introduced the intervals
for $\mathcal{i}\in \mathcal{M}$ and $k\in \mathcal{N}\setminus \left \{N\right \}$ . The first step is to prove that such intervals are well-defined. We start with the following auxiliary lemma, that follows directly from Assumption $(\mathbf{K})$
Lemma 3.1. With the setting of the Main Theorem 2.2, and referring to the previous definitions, given $\mathbf{K^{\mathcal{ij}}}$ under Assumption $(\mathbf{K})$ , then it exists $C\gt 0$ such that the following inequality holds
with $C= c_{\mathbf{K}} \sigma ^{\mathcal{M}}$ , where $\sigma ^{\mathcal{M}} = \sum _{j\in \mathcal{M}} \sigma ^{\mathcal{j}}$ .
Lemma 3.2 (Ordering preservation). Assume ${\mathbf{A}}^{\mathcal{ij}}$ and $\mathbf{K}^{\mathcal{ij}}$ under assumptions $({\mathbf{A}})$ and $(\mathbf{K})$ , respectively, for all $\mathcal{i},\mathcal{j}\in \mathcal{M}$ . Let us consider the DPA system described by (2.4) with initial conditions $\bar{x}^{\mathcal{i}}$ constructed in (2.1), for $\mathcal{i}\in \mathcal{M}$ , and a finite time $T\gt 0$ . Then, for all $t\in [0,T)$ there is a positive constant $\mu$ independent from $\mathcal{N}$ – and so from $N$ too – such that the distance between two adjacent opinions $x^{\mathcal{i}}_k, x^{\mathcal{i}}_{k+1} \in C[0,T]$ is bounded from below by
for all $k\in \mathcal{N}\setminus \left \{N\right \}$ and $\mathcal{i} \in \mathcal{M}$ .
Proof. Given $T\gt 0$ and $\mathcal{i}\in \mathcal{M}$ , we define $\tau _1$ as
then the same index $k$ corresponds also to the one of the maximum $\rho ^{\mathcal{i}}_k$ at time $\tau _1$ because $I^i_k$ is the minimum interval of the $\mathcal{N}$ partition of $\Omega$ for the $i$ -th agent at time $\tau _1$ .
At this point, let assume that exists $\tau _2 \in (\tau _1, T)$ such that
We show that the existence of $\tau _2$ would bring to a contradiction. Let us consider the evolution of the interval $I^i_k$
At time $t=\tau _1$ , as highlighted before, by construction of the discrete densities in (2.2) we have $\rho ^{\mathcal{i}}_k \ge \rho ^{\mathcal{i}}_l$ for all $l\ne k$ .
Then, the monotonicity of $\Phi ^{\mathcal{i}}$ gives
Thanks to (3.2) we get
which holds while choosing $\mu \ge C$ . At this point, we fix $t^*\in (\tau _1,\tau _1+\delta \lt \tau _2)$ with $\delta$ as small as we want, and we get
due to the positiveness of the last term we get the wished result which show the absurd,
this proves that $I^i_k(t)$ cannot decrease faster than $I^i_k(0) e^{- \mu t}$ . Nevertheless, this does not deny the existence of an index $\tilde{k}$ such that the interval $I^i_{\tilde{k}}(t)$ , satisfying $I^i_{\tilde{k}} (\tau _1) \gt I^i_{\tilde{k}}(0)$ , decreases faster than $I^i_k(t)$ . This means that could exists $\tilde{\tau }_1 \gt \tau _1$ for which $I^i_{\tilde{k}}(\tilde{\tau }_1) = I^i_{\tilde{k}}(0)$ , with $\tilde{\tau }_1 \lt T$ . At this point, we should prove that there exists $\tilde{\mu }$ such that $I^i_{\tilde{k}}(t) \ge e^{-\tilde{\mu }t} I^i_{\tilde{k}}(0)$ for all $t \in (\tilde{\tau }_1, T)$ . To prove it, we repeat the same procedure explained before but defining $\tilde{\tau }_1$ considering the set of indexes $\mathcal{N}/ \{k\}$ . The final exponential rate will be the largest $\mu$ among those considered.
Let us also consider the case with $k$ not unique, i.e. for $\tau _1$ there are several intervals satisfying the definition of $\tau _1$ , the set of these indexes is denoted by $\mathcal{J}=\{ k_j \}$ . If there is at least one $k_{j^*}$ not adjacent to other indexes of $\{k_j\}$ , then we take that index and we follow the proof above. In the event that there are three indexes of $\{k_j\}$ in a row, we take without distinction that one with the fastest decrease in time of the interval $I^i_{k_j}$ . At this point, we are back to the steps shown above. This concludes the proof.
Remark 3.3. A similar procedure of the one in Lemma 3.2 allows to produce the upper bound on discrete opinions
This estimate, together with the one in Lemma 3.2, allows to deduce the following bounds on the discrete densities in (2.2)
with $m^{\mathcal{i}}$ and $M^{\mathcal{i}}$ in assumption (In2).
Lemma 3.4 (Velocity boundedness). Fix $T\gt 0$ and assume ${\mathbf{A}}^{\mathcal{ij}}$ and $\mathbf{K}^{\mathcal{ij}}$ , respectively, under assumptions $({\mathbf{A}})$ and $(\mathbf{K})$ for all $(\mathcal{i},\mathcal{j})\in \mathcal{M}\times \mathcal{M}$ . Then, solutions to system (2.4) satisfy
Proof. Using the equation for the evolution of the partitioning, we get
for some constants $c_1,c_2,c_3\gt 0$ . Then, the thesis follows from equation (3.4), assumption $(\mathbf{K})$ and the fact that $x_k^{\mathcal{i}}\in \Omega$ because (2.5) and Lemma 3.2.
We now have all the tools needed to prove the convergence in some strong sense for the piecewise constant densities of equation (2.14). We based our strategy on the ones proposed in the context of DPA, see for instance the proofs in [Reference Fagioli and Radici25, Reference Fagioli and Tse27], that are using the generalised Aubin-Lions lemma version in [Reference Rossi and Savaré45], that we report here in a simplified version adapted to our setting.
Theorem 3.5. Let $T \gt 0$ be fixed, and $\rho ^{\mathcal{N}}(t,\cdot )\,{:}\, [a,b] \to \mathbb{R}$ be a sequence of non-negative probability densities for every $t \in [0,T]$ and for every $N \in \mathbb{N}$ , where $\mathcal{N} = \{0,\ldots,N\}$ . Moreover, assume that $\| \rho ^{\mathcal{N}}(t,\cdot )\|_{L^\infty } \leq M$ for some constant $M$ independent on $t$ and $N$ . If
-
(I) $\sup _N \int _0^T TV[\rho ^{\mathcal{N}}(t,\cdot )]dt \lt \infty$ ,
-
(II) $d_{W^1}(\rho ^{\mathcal{N}}(t,\cdot ),\rho ^{\mathcal{N}}(s,\cdot )) \lt C|t-s|$ for all $t,s \in [0,T]$ , where $C$ is a positive constant independent on $N$ ,
then $\rho ^{\mathcal{N}}$ is strongly relatively compact in $L^1([0,T]\times [a,b])$ .
The result reads as follows
Proposition 3.6. Let $\rho ^{\mathcal{i},\mathcal{N}}$ be defined as in equation (2.14) for $\mathcal{i}\in \mathcal{M}$ . Then, there exists $\rho ^{\mathcal{i}} \in L^1 \cap L^{\infty }(\Omega _T)$ such that $\|\rho ^{\mathcal{i},\mathcal{N}} - \rho ^{\mathcal{i}}\|_{L^1} \to 0$ as $N \to \infty$ .
Proof. The proof reduces to the application of Theorem 3.5, in order to show that we can apply that result we first prove that
To show this result, we look for a Grönwall type inequality. We start performing the following preliminary computation
The first step consists of proving the Lipschitz continuity in time of $t \to TV[\rho _t^{\mathcal{i},\mathcal{N}}(t,\cdot )]$ . The total variation can be explicitly computed as
From the boundedness in Lemmas 3.2 and 3.4, for all $s,t\in (0,T)$ , we estimate
Then, it follows
that proves the asserted Lipschitz continuity.
We now consider the time derivative
Rearranging the sum and defining the operator
with we can rewrite the previous equation as
At this point, we show that the terms involving the diffusion are always negative, i.e.
In order to prove this statement, we should distinguish different cases. First, we observe that ${\textrm{s}}_k$ is always zero if $\rho _{k-1}^{\mathcal{i}}\lt \rho _{k}^{\mathcal{i}}\lt \rho _{k+1}^{\mathcal{i}}$ or $\rho _{k+1}^{\mathcal{i}}\lt \rho _{k}^{\mathcal{i}}\lt \rho _{k-1}^{\mathcal{i}}$ . In the other two cases, namely $\rho _{k}^{\mathcal{i}}\lt \rho _{k-1}^{\mathcal{i}}$ and $\rho _{k}^{\mathcal{i}}\lt \rho _{k+1}^{\mathcal{i}}$ , or $\rho _{k-1}^{\mathcal{i}},\,\rho _{k+1}^{\mathcal{i}}\lt \rho _{k}^{\mathcal{i}}$ and $\rho _{k-1}^{\mathcal{i}}\lt \rho _{k}^{\mathcal{i}}$ , the monotonicity of $\Phi ^{\mathcal{i}}$ implies, respectively, ${\textrm{s}}_k\leq 0$ and $B_k^{\mathcal{i}}\leq 0$ , and ${\textrm{s}}_k\geq 0$ and $B_k^{\mathcal{i}}\geq 0$ , and hence, the negativity of the diffusion contribution is proved.
Concerning the term involving $\Theta _k^{\mathcal{i}}$ , we can rearrange the sum as follows
Observing that $|\Theta _k^{\mathcal{i}}|\leq C$ because of equation (3.2) and that
we can bound
We can finally estimate
and thus, equation (3.5) follows by Grönwall type argument.
We now prove that the second requirement of Theorem 3.5 holds, namely there exists a positive constant $C$ such that
In order to do this, we use the isometry of equation (2.10), where the pseudo-inverse function for $\rho ^{\mathcal{i},\mathcal{N}}$ is given by
Then, for any $t\gt s$ , we have
in view of Lemma 3.4.
Once proved the bounds described by equations (3.5) and (3.7), we can apply Theorem 3.5, which concludes the proof.
Lemma 3.7 (Convergence of momenta). Given $\mu _{\rho ^{\mathcal{i}}}(t)$ and $\mu _{x^{\mathcal{i}}}^{\mathcal{N}}(t)$ , respectively,
we have that
for all $t\gt 0$ .
Proof. We recall that $x^i_0 + x^i_N = 0$ , and $\Omega = [{-}1,1]$ , from the definitions we have
where we used equation (2.14). We conclude that there exists a constant depending only on the domain $\Omega$ such that
which concludes the proof.
The following Proposition concerns the convergence of the approximated nodes $a_{\mathcal{N}}^{\mathcal{i}}$ .
Proposition 3.8. Let $T\gt 0$ be fixed and consider $\mathbf{V}$ under assumption $(\mathbf{V})$ . Then, for any $\mathcal{i}\in \mathcal{M}$ , there exists $a^{\mathcal{i}}\in C([0,T])$ such that $a_{\mathcal{N}}^{\mathcal{i}}\to a^{\mathcal{i}}$ as $N\to \infty$ uniformly in $[0,T]$ . Moreover, the limits $a^{\mathcal{i}}$ satisfy (2.13) for all $t\in [0,T]$ .
Proof. We first notice that from (2.4b) and the boundedness of $\mathbf{V}$ , we have the uniform bound
for all $\mathcal{i}\in \mathcal{M}$ uniformly in $N$ . Thus, there exist $a^{\mathcal{i}}$ such that $a_{\mathcal{N}}^{\mathcal{i}}(t)$ pointwise converges (up to subsequences) to $a^{\mathcal{i}}(t)$ as $N\to \infty$ . Consider now $N_1,N_2\in \mathbb{N}$ , then
where we used the estimate from the proof of Lemma 3.7 and the fact that by straightforward manipulations we have
Thus, by using the integral version of Gronwall’s inequality we can deduce
and then
that ensure the uniform convergences of $a_{\mathcal{N}_1}^{\mathcal{i}}$ to $a^{\mathcal{i}},$ for all $\mathcal{i} \in \mathcal{M}$ .
In order to show that $a^{\mathcal{i}}$ satisfies (2.13), it is enough to observe that we can invoke the dominated convergence theorem since by the continuity of $\mathbf{V}$ and the uniform converges proved we have that
and $\mathbf{V}(\mu _{x^{\mathcal{i}}}^{\mathcal{N}}, \mu _{x^{\mathcal{j}}}^{\mathcal{N}}, a_{\mathcal{N}}^{\mathcal{ij}})$ is uniformly bounded w.r.t. $N$ . Thus,
for all $t\in [0,T]$ .
We now prove that the empirical measures associated with the solution of equation (2.4a) and the piecewise constant densities in equation (2.14) share the same limit with respect to a suitable topology.
Lemma 3.9. For any $T\gt 0$ , the empirical measures associated with the solution of equation (2.4a), defined by
satisfy
for all $t\in [0,T]$ , where $\rho ^{\mathcal{i}}$ is the limit obtained in Proposition 3.6.
Proof. We take again advantage of the isometry between the $1-$ Wasserstain space for probability measures and the $L^1$ space in the space pseudo-inverse functions by noticing that the pseudo-inverse of an empirical measure is piecewise constant and then
The statement then follows from a triangulation argument.
3.2. Convergence to weak solutions
With $\mathbf{a}^{\mathcal{N}}$ we denoted the vector $(a^{\mathcal{i}}_{\mathcal{N}})_{\mathcal{i}\in \mathcal{M}}$ , of agents with piecewise constant opinion distribution $\rho ^{\mathcal{i},\mathcal{N}}$ , while $\mathbf{a}$ is related to the vector of continuous distributions $\boldsymbol{\rho }$ . This distinction is not stressed in the rest of the paper where the context does not allow misunderstanding.
Remark 3.10. We notice that evaluating the operator $\beta ^{\mathcal{i}}$ in (3.8) we have
Moreover,
Lemma 3.11. Let $T\gt 0$ , and consider the kernels ${\mathbf{A}}^{\mathcal{ij}}$ , $\mathbf{K}^{\mathcal{ij}}$ under assumptions $({\mathbf{A}})$ and $(\mathbf{K})$ , respectively. Let $\rho ^{\mathcal{i},\mathcal{N}}$ and $\tilde{\rho }^{\mathcal{i},\mathcal{N}}$ be the sequences defined in equations (2.14) and (3.8), respectively, and their limits $\rho ^{\mathcal{i}}$ given by Proposition 3.6 and Lemma 3.9 , for all $\mathcal{i} \in \mathcal{M}$ . Then, for every $\zeta \in C_{0}^\infty \left (\Omega _T\right )$ we have
as $N\to \infty$ .
Proof. We only prove equation (3.12), since equations (3.13) and (3.14) follow from similar argument, and equation (3.11) is a direct consequence of the $L^1$ strong compactness proved in Proposition 3.6. We first split the terms as following
We now treat the two terms separately. Assumption $({\mathbf{A}})$ and equation (3.10) ensure the following bound
where $C$ is a constant depending on $\left \|\partial _1{\mathbf{A}}^{\mathcal{ij}}\right \|_{\infty }$ , $\left \|\partial _x\zeta \right \|_{\infty }$ , $Lip\left (\Phi ^{\mathcal{i}}\right )$ and $\sigma ^{\mathcal{M}}$ . In order to bound the second integral, let us introduce $\Pi ^{\mathcal{i},\mathcal{N}}$ an optimal transport plan between $\tilde{\rho }^{\mathcal{i},\mathcal{N}}$ and $\rho ^{\mathcal{i}}$ . Then, we have
where in this case $C$ is a constant depending on $\|\rho ^{\mathcal{i}}\|_\infty$ , $\left \|\partial _x\zeta \right \|_{\infty }$ , and the constant $c_{1,A}$ from Assumption $({\mathbf{A}})$ . The convergences in Proposition 3.6 and Lemma 3.9 ensure that equation (3.12) holds.
We are now in the position of proving that the limit densities and nodes satisfy the weak formulation in the sense of Definition 2.1. More precisely, we are going to show that for $N\to +\infty$ we have
that combined with the convergences in Lemma 3.11 gives the assertion. We state the following
Proposition 3.12. Given $M\in \mathbb{N}$ , and $T\gt 0$ fixed, for all $\mathcal{i},\mathcal{j}\in \mathcal{M}$ consider ${\mathbf{A}}^{\mathcal{ij}}$ , $\mathbf{K}^{\mathcal{ij}}$ , $\mathbf{V}$ and $\Phi ^{\mathcal{i}}$ under assumptions $({\mathbf{A}})$ , $(\mathbf{K})$ , $(\textbf{V})$ and $(Dif)$ , respectively. Let $\bar{\rho }^{\mathcal{i}}\,{:}\,\Omega \to{\mathbb{R}}$ under assumptions $(In1)$ and $(In2)$ for all $\mathcal{i}\in \mathcal{M}$ .
Then, for all $\mathcal{i} \in \mathcal{M}$ the densities $\rho ^{\mathcal{i},\mathcal{N}}$ introduced in equation (2.14) and $\tilde{\rho }^{\mathcal{i},\mathcal{N}}$ introduced in equation (3.8) satisfy the condition given by the limit (3.15) as $N\to \infty$ , for all $\zeta \in C_0^{\infty }(\Omega _T)$ .
Proof. We start considering the term involving the time derivative. By definition of $\rho ^{\mathcal{i},\mathcal{N}}$ in equation (2.14), a discrete integration by parts and Fundamental Theorem of Calculus give
A second-order expansion of $\zeta$ around $x_{k+1}^{\mathcal{i}}(t)$ in the first average integral and around $x_{k}^{\mathcal{i}}(t)$ in the second average integral produces
where $\hat{x}_{k}^{\mathcal{i}}$ and $\hat{x}_{k+1}^{\mathcal{i}}$ are points in $\left [x_{k}^{\mathcal{i}},x\right ]$ and equation $\left [x,x_{k+1}^{\mathcal{i}}\right ]$ , respectively. We now combine the first and third terms on the r.h.s. above and use (2.4) in order to obtain
where
and
We now combine the integral $A_1$ with the two terms involving the diffusion in equation (3.15) in order to show that
Invoking equation (3.9) and the fact that $\partial _x\zeta (t,x_{0}^{\mathcal{i}})=\partial _x\zeta (t,x_{N}^{\mathcal{i}})=0$ , we can compute
which can be combined with $A_1$ by shifting the indexes and using again the fact that the test function vanishes at the boundary.
Recalling the definition of $\theta _k^{\mathcal{i}}$ in equation (2.8), rearranging the indexes in $A_2$ , using the fact that $\partial _x\zeta$ vanishes at the boundary of $\Omega$ and summing with the second term in equation (3.15) we obtain
A first-order expansion on $\partial _x\zeta$ around $x_k^{\mathcal{i}}$ for $\hat{\hat{x}}_k^{\mathcal{i}}\in \left [x_k^{\mathcal{i}},x\right ]$ , together with the definition of $\rho _k^{\mathcal{i}}$ and assumption $(\mathbf{K})$ , yields
that vanishes as $N\to \infty$ together with $\sigma _N^{\mathcal{i}}$ . We are now left in showing that the remainder, i.e.
goes to zero. We first notice that for all $h,k\in \mathcal{N}\setminus \left \{N\right \}$ , we have
for some constant $C\gt 0$ , then
where the second inequality holds in view of Lemma 3.4 and the BV bound on $\rho _k^{\mathcal{i}}$ .
4. Modelling, simulation and interpretation
4.1. Modelling
As stated in the introduction, the objective of this model is to elucidate various aspects inherent in interactions on social networks and social media. Specifically, it focuses on elements related to network evolution, homophily and heterophobia. The aim is to examine whether polarisation of opinions and fragmentation of the population can be observed solely by modelling the processes governing network rewiring and the epistemic process. It is essential to note that we do not explicitly model polarisation; instead, we adhere to describing the dynamics of opinion formation that underlie the formation of echo chambers and epistemic bubbles.
In recent years, epistemologists have placed particular emphasis on studying and understanding the formation and evolution processes of the aforementioned social structures. Following Nguyen’s definition [Reference Thi Nguyen38], echo chambers and epistemic bubbles are social epistemic structures based on two distinct types of filtering. In the case of epistemic bubbles, filtering occurs at the network level, while for echo chambers, it takes place at the epistemic process level – specifically, in the attitude towards an interlocutor. In this work, we consider an attitude guided by the distance between the opinions of two interacting agents. Nevertheless, recent studies suggest that it is important to also take into account individuals’ biases for a more comprehensive analysis of the social dynamics based on distrust leading to social filtering, as demonstrated in the work by Pederneschi [Reference Pederneschi43].
In this work, we introduce the concepts of attitude areas and a Euclidean network to describe these dynamics.
Attitude Areas – Open-Mindedness
In this section, we model and simulate a possible choice of opinion dynamic. In particular, we focus our attention on a model that takes into account the heterophobia and homophilia dynamics. The model that we propose is based on five attitude areas: attraction/homophilia, curiosity, indifference, mistrust, repulsion/heterophobia. When two agents interact, their attitude depends on the distance between their respective opinions. We do not consider the attitude depending locally on the opinion itself, this could be a possible improvement that describes the low propensity of changing extreme beliefs. The interaction can be attractive, i.e. the agents move towards a position of consensus looking for a compromise, or can be repulsive, i.e. each agent changes its own opinion moving farther from the one of the other agent. We consider the DPA structure of equations (2.4a), (2.4b), (2.7), (2.8). The operator describing this phenomenon has the following structure
where the function $\omega$ depends on the network connections, and $\zeta$ is the attitude function that measures the distance between the agents’ mean opinion. Being $s$ the distance between the mean opinions, the five attitude areas coincide with the following intervals
The function $\zeta$ is given by
depending on the values of the extreme of the intervals it looks like those in Figure 1. The term open-mindedness refers to the individual’s inclination to positively consider opinions that differ from their own. In this article, the quantitative description of this term is associated with the value $s \in [0,2]$ such that $\zeta (s)=0$ . In other words, open-mindedness corresponds to the maximum distance within which an agent regards another opinion favourably.
Diffusion
Moreover, the opinion dynamic is not ruled only by the direct interaction with the connected agents in the network. We continuously get inputs from all the media, this phenomenon is described in this model by the following operator
In this case, the interaction is not filtered by the network connections, i.e. by $\omega$ , and it is not affected by the attitude. This operator plays the role of the diffusion mobility, the opinion tends to diffuse the more the inputs are far from it, and it is not affected by the diffusion when the inputs coincide with the opinion itself. The underlying idea is that we cannot process actively – i.e. through $\zeta$ – all the information that we get. Those inputs that we cannot elaborate they influence our opinion distribution smoothing it depending on the distance between the input and our mean opinion.
Evolution of the Network
$\,$ As anticipated in the introduction, the Euclidean network relies on the distance between agents in $\mathbb{R}^2$ . The choice of employing $\mathbb{R}^d$ with $d=2$ instead of another dimension lacks specific applicative rationale in this case. Should a concrete application be considered, the dimensions of the network space might depend on factors such as biases, as discussed in [Reference Pederneschi43]. In other words, the network space could potentially capture factors of social segregation correlated with the subject of opinion evolution under consideration.
In this paper, the distance would play a singular role, specifically in defining the interaction radius between agents through the function $\zeta$ . This function is associated with an interaction resembling that of social networks and epistemic bubbles, where filtering occurs at the network level, and interaction in the network space takes place locally rather than globally. We consider $r_{\textit{loc}}$ the radius defining the ball of the local interaction,
The agents $a^{\mathcal{i}}$ and $a^{\mathcal{j}}$ interact if their distance on the network is smaller or equal to $\rho _{\textit{loc}}$ . The global interaction coincides with the radius $\rho _{\textit{loc}}=+\infty$ . The initial condition used for our simulation is the one given in Figure 2.
Considering 3 different radii of interaction the network connections change as in Figure 3.
The evolution of the agents is ruled by the following operator
with $\mathbf{e}_l$ being the $j$ -th normal vector. In this scenario, we have three terms to consider. The function $\omega$ evaluates the distance between two agents in the network space; if this distance is not greater than $\rho _{\textit{loc}}$ , interaction occurs between the agents. The function $\zeta$ determines whether there is attraction or repulsion and assesses the respective intensity by evaluating the distance between the opinion means of the two agents. The last term defines both the intensity and the direction of movement in the network space. Both the last term and the attitude function play a role in determining the interaction intensity. However, their roles should not be confused: the attitude function pertains to the distance between opinions, while the third term depends on the network.
4.2. Simulation
Radicalisation
The term radicalisation denotes an agent’s inclination to anchor their opinion within a defined range of opinions. In our model, this phenomenon is observed when the opinion distribution increases within an interval and decreases sharply outside of it.
Remark 4.1. Note that this dynamics is not observable if one opts for a description that does not consider the opinion distribution but only a singular value.
We consider the attitude areas given by the following intervals: $r_{\textit{f}}=0.25$ , $r_{\textit{a}}=0.34$ , $r_{\textit{r}}=0.36$ , $r_{\textit{l}}=0.65$ . This setting coincides with the $\zeta$ function described by the black line in Figure 1.
Given the initial opinion distribution as in Figure 4, we can observe that the distribution evolves towards a more and more radicalised society as the radius increases. As evident from Figure 5, contrary to common intuition, increasing the interaction radius—thus engaging with a greater number of agents—leads to distributions becoming more concentrated around either positive or negative values. As the interaction radius expands, fewer agents exhibit distributions encompassing both positive and negative values.
The same phenomenon is described by the histogram of the mean opinions distribution in Figure 6.
Opinion Polarisation and Network Fragmentation
It is intriguing to examine the final network while varying the parameters of the attitude areas. We set the interaction radius as $\rho _{\textit{loc}}= 5$ , and we compare the first three functions depicted in Figure 1. In this scenario, we note that a more open-minded society corresponds to a less fragmented network, as illustrated in Figure 7.
While focusing solely on the operator $\mathbf{K}^{\mathcal{ij}}$ by setting $\mathbf{A}^{\mathcal{i}}=0$ , we observe the phenomenon of polarisation, i.e. the tendency of agents towards an opinion distribution centred on more extreme values, in our case $\pm 1$ .
It is interesting to observe how the connectivity of the population is the real driver of the polarisation, instead of the open-mindedness. We now compare the results of the simulation with fixed open-mindedness. We chose the most close-minded population, i.e. the one described by the blue function in Figure 1. Increasing the radius of the interaction, the opinion gets more and more polarised. In Figure 8, we notice that a more connected society tends to cluster into extreme opinions, while a less connected society keeps a more sparse distribution of opinions. This is a not expected behaviour, usually a large or global interaction is related to a higher consensus. In the work by Tucker et al. [Reference Tucker, Guess, Barberá, Vaccari, Siegel, Sanovich, Stukal and Nyhan53], it is emphasised how in the literature on opinion polarisation, the crucial role of social networks in accelerating and intensifying the polarisation of opinions on highly debated topics online is now well-established. This dynamic aligns with the outcomes of our simulations, given that the operator $\mathbf{K}^{\mathcal{ij}}$ describes the interaction process on social networks.
If we observe the evolution of the network, it seems that increasing the radius of interaction does not really affect the fragmentation of the population, but it plays a role in the opinion homogeneity of the network clusters. In Figure 9, at the same fixed time, a larger radius of interaction brings to a wider network space, and the groups of connected agents show a stronger homogeneity of the opinion.
4.3. Conclusions, interpretations and possible follow-up
The goal of this model is to introduce the study of the processes describing the interaction on social networks and social media. We mainly focused on the role of the attitude areas and on that of the radius of interaction. The dynamics ruling the opinion formation of agents interacting on social platforms is different from the one described by models based on alignment, averaged consensus or Cucker-Smale with positive communication rate.
Recently, sociologists and philosophers described the epistemic processes of the hyperconnected society typical of the last two decades. The high amount of interactions and notions, together with their high frequency, modified the way how we create and reinforce our beliefs. Authors like Nguyen, see [Reference Thi Nguyen38], explain how the network and the opinion distance are the discriminant for different epistemic processes. In our model, we describe these two aspects through the definition of the attitude areas and through the dynamic of the network, which takes into account the distance on the network and the distance of the opinions.
Drawing on the literature, e.g. [Reference Begby5, Reference Benatti, de Arruda, Silva, Comin and da Fontoura Costa8, Reference Lim and Bentley34, Reference Tucker, Guess, Barberá, Vaccari, Siegel, Sanovich, Stukal and Nyhan53], we observe that describing interactions through attitude areas and Euclidean network suggests that the approach is heading in the right direction to capture the dynamics of polarisation, radicalisation and fragmentation that arise through interactions on social networks and social media. A particularly intriguing phenomenon to observe is the fragmentation of society into numerous ‘mono-opinion’ groups.
Future steps could involve assuming that the social strength $\sigma ^{\mathcal{i}}$ of each agent evolves over time based on connections. Additionally, in our case, we used a single function $\zeta$ for the entire population; however, it would be interesting to consider a different function for each agent, reflecting varying levels of open-mindedness. Numerous possible avenues exist, but caution should be exercised to avoid overexposing the problem to parameters and external choices. The authors’ intention is to continue in the direction of general models based on epistemological theories and interacting group theories. Certainly, an intriguing insight for future work comes from Pederneschi [Reference Pederneschi43] concerning the possibility of introducing biases to explain the dynamics of trust and distrust.
Financial support
The research of SF is supported by the Ministry of University and Research, Italy under the grant PRIN 2020 – Project N. 20204NT8W4, Nonlinear Evolutions PDEs, fluid dynamics and transport equations: theoretical foundations and applications. The research of SF and GF is supported by the Italian INdAM project N. E55F22000270001 ‘Fenomeni di trasporto in leggi di conservazione e loro applicazioni’. SF is also supported by the University of L’Aquila 2021 project 04ATE2021 – ‘Mathematical Models For Social Innovations: Vehicular And Pedestrian Traffic, Opinion Formation And Seismology’.
Competing interests
There are no competing interests.