Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.667585
Title: Leader-follower consensus under peer-pressure in complex networks
Author: Vargas-Estrada, Eusebio
ISNI:       0000 0004 5361 4727
Awarding Body: University of Strathclyde
Current Institution: University of Strathclyde
Date of Award: 2015
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
Synchronisation is an important process for different kinds of systems, such as biological, chemical, physical and social. Among the related synchronisation problems, consensus has received high attention because of the distributed properties shown by its models and the possibility they offer for controlling complex systems. When dealing with consensus processes in social networks, we known from empirical evidence that the formation of opinions is not free from being influenced by people around every actor, and more, it is well known that some of the actors may play a leading role and guide a social system to a final state different from the pure average consensus. A main paradigm while modelling interactions among actors in social networks is that every actor receives and transmits information from and to her nearest neighbours, thus implicitly assuming that the decisions of a given actor only are influenced by their directly connected peers, and not tking into account indirect influences coming from not directly connnected peers in the same social network, for example, the influence coming from the friend's friend of a friend. Our work studies consensus processes in the presence of influence coming from not only those directly connected actors, but from other ones in the same network. We call this influence peer pressure (PP). We propose a consensus model that takes into account direct and indirect PP modelled as a function of the social distance among actors. We apply this consensus model to different real social networks assuming three different decay laws for the strength of PP, and in the presence of leaders and without them. We choose those nodes acting as leaders according to different centrality criteria, as well as randomly, and compare thier performance for driving the system. Since it is natural that different leaders may diverge in their positions, we introduce a divergence parameter among the initial states of the leaders with respect to the avreage consensus of the system, to take the feature into account in our model. We then analyse the effects of PP on two different real cases of diffusion of innovation processes. We show that as the strength of indirect PP increases, the centrality criteria used to select the leaders has a decaying effect on the effectiveness of such leaders to better drive a consensus process, allowing random leaders to be as good as those with better centrality. Our work also shows that, despite divergence among leaders induces higher times for reaching consensus, this effect is reduced for stronger levels of PP present in the system. For the case of diffusion innovations our model reproduces the behaviour of the empirical data, and we demonstrate that certainlevels of PP are necessary to match the results coming from two different studies, supporting our hypothesis that indirect PP is an important factor to be taken into account when modelling opinion formations in social networks. Leaders emerging by global centrality criteria in networks with tightly connected groups can be counterproductive. This can be tackled by selecting node-leaders in a local basis. This effect is also reduced when indirect PP is allowed to be higher. This finding points to the fact that distance among nodes is an important characteristic for consenus processes. For the purpose of studying this structural feature, we propose a distance-sum heterogeneity index based on a fictional consensus process. We conjecture that an special type of graph, that we call complete split graph, is related with the maximization of the index, and based on this conjecture we study the relative distance-sum heterogeneity of random graphs and different real-world networks, which allows us to characterise them. We propose a spectral representation of the distance-sum heterogeneity index for networks that we call S-plots. We also study the relation between the time for consensus and the distance-sum heterogeneities in complex networks from different nature.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.667585  DOI: Not available
Share: