arXiv subjects

Giacomo Albi

Publications and source records attributed to Giacomo Albi.

44 records · Page 3Linked to original sources

arXiv2016

Opinion dynamics over complex networks: kinetic modeling and numerical methods

In this paper we consider the modeling of opinion dynamics over time dependent large scale networks. A kinetic description of the agents' distribution over the evolving network is considered which combines an opinion update based on binary interactions between agents with a dynamic creation and removal process of new connections. The number of connections of each agent influences the spreading of opinions in the network but also the way connections are created is influenced by the agents' opinion. The evolution of the network of connections is studied by showing that its asymptotic behavior is consistent both with Poisson distributions and truncated power-laws. In order to study the large time behavior of the opinion dynamics a mean field description is derived which allows to compute exact stationary solutions in some simplified situations. Numerical methods which are capable to describe correctly the large time behavior of the system are also introduced and discussed. Finally, several numerical examples showing the influence of the agents' number of connections in the opinion dynamics are reported.

math.NA↗

arXiv2015

On the optimal control of opinion dynamics on evolving networks

In this work we are interested in the modelling and control of opinion dynamics spreading on a time evolving network with scale-free asymptotic degree distribution. The mathematical model is formulated as a coupling of an opinion alignment system with a probabilistic description of the network. The optimal control problem aims at forcing consensus over the network, to this goal a control strategy based on the degree of connection of each agent has been designed. A numerical method based on a model predictive strategy is then developed and different numerical tests are reported. The results show that in this way it is possible to drive the overall opinion toward a desired state even if we control only a suitable fraction of the nodes.

math.OC↗

arXiv2015

Uncertainty Quantification in Control Problems for Flocking Models

In this paper the optimal control of flocking models with random inputs is investigated from a numerical point of view. The effect of uncertainty in the interaction parameters is studied for a Cucker-Smale type model using a generalized polynomial chaos (gPC) approach. Numerical evidence of threshold effects in the alignment dynamic due to the random parameters is given. The use of a selective model predictive control permits to steer the system towards the desired state even in unstable regimes.

math.NA↗

arXiv2014

Boltzmann type control of opinion consensus through leaders

The study of formations and dynamics of opinions leading to the so called opinion consensus is one of the most important areas in mathematical modeling of social sciences. Following the Boltzmann type control recently introduced in [G. Albi, M. Herty, L. Pareschi arXiv:1401.7798], we consider a group of opinion leaders which modify their strategy accordingly to an objective functional with the aim to achieve opinion consensus. The main feature of the Boltzmann type control is that, thanks to an instantaneous binary control formulation, it permits to embed the minimization of the cost functional into the microscopic leaders interactions of the corresponding Boltzmann equation. The related Fokker-Planck asymptotic limits are also derived which allow to give explicit expressions of stationary solutions. The results demonstrate the validity of the Boltzmann type control approach and the capability of the leaders control to strategically lead the followers opinion.

math.OC↗

arXiv2014

Kinetic description of optimal control problems and applications to opinion consensus

In this paper an optimal control problem for a large system of interacting agents is considered using a kinetic perspective. As a prototype model we analyze a microscopic model of opinion formation under constraints. For this problem a Boltzmann-type equation based on a model predictive control formulation is introduced and discussed. In particular, the receding horizon strategy permits to embed the minimization of suitable cost functional into binary particle interactions. The corresponding Fokker-Planck asymptotic limit is also derived and explicit expressions of stationary solutions are given. Several numerical results showing the robustness of the present approach are finally reported.

math.OC↗

arXiv2013

Asymptotic Preserving time-discretization of optimal control problems for the Goldstein-Taylor model

We consider the development of implicit-explicit time integration schemes for optimal control problems governed by the Goldstein-Taylor model. In the diffusive scaling this model is a hyperbolic approximation to the heat equation. We investigate the relation of time integration schemes and the formal Chapman-Enskog type limiting procedure. For the class of stiffly accurate implicit-explicit Runge-Kutta methods (IMEX) the discrete optimality system also provides a stable numerical method for optimal control problems governed by the heat equation. Numerical examples illustrate the expected behavior.

math.NA↗

arXiv2012

Modeling self-organized systems interacting with few individuals: from microscopic to macroscopic dynamics

In nature self-organized systems as flock of birds, school of fishes or herd of sheeps have to deal with the presence of external agents such as predators or leaders which modify their internal dynamic. Such situations take into account a large number of individuals with their own social behavior which interact with a few number of other individuals acting as external point source forces. Starting from the microscopic description we derive the kinetic model through a mean-field limit and finally the macroscopic system through a suitable hydrodynamic limit.

physics.bio-ph↗

arXiv2012

Binary interaction algorithms for the simulation of flocking and swarming dynamics

Microscopic models of flocking and swarming takes in account large numbers of interacting individ- uals. Numerical resolution of large flocks implies huge computational costs. Typically for $N$ interacting individuals we have a cost of $O(N^2)$. We tackle the problem numerically by considering approximated binary interaction dynamics described by kinetic equations and simulating such equations by suitable stochastic methods. This approach permits to compute approximate solutions as functions of a small scaling parameter $\varepsilon$ at a reduced complexity of O(N) operations. Several numerical results show the efficiency of the algorithms proposed.

physics.comp-ph↗