SearcharxivSearch

arXiv subjects

Ivan Samoylenko

Publications and source records attributed to Ivan Samoylenko.

3 recordsLinked to original sources

SimPol: Simulating polarisation in political belief networks in European countries

Here we combine empirical network analysis with agent-based modelling to understand how different ways of structuring belief systems may affect the polarisation drive, and how the diversity of belief systems in Europe may result in different polarisation trajectories. Using the 2016 European Social Survey, we infer belief networks across 23 European countries via a Bayesian algorithm, revealing that belief systems are predominantly organised around immigration, LGBT rights, and economic interventionism, reflecting the influence of populist discourse across the continent. We further verify a Western-Eastern divide across the national belief networks: in Western European countries, left-right self-identification is a more reliable predictor of broader belief alignment, whereas in Eastern Europe this relationship breaks down. By applying these empirical belief networks into a sociologically grounded agent-based model, we further show that polarisation is amplified by high individual belief rigidity and low susceptibility to social influence, and that cross-country differences in polarisation levels mirror the same geographic divide observed in belief network topology. These findings establish belief networks topologies as a structural driver of political polarisation, with implications for understanding and anticipating polarisation dynamics across diverse European contexts. We find that populations are not polarised when little attention is placed on maintaining internal coherence and polarisation levels are moderate when high attention is placed in both keeping internal coherence and agreement in beliefs with others.

physics.soc-ph

Why are there six degrees of separation in a social network?

A wealth of evidence shows that real world networks are endowed with the small-world property i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical regularity known as the six degrees of separation. Why social networks have this ultra-small world organization, whereby the graph's diameter is independent of the network size over several orders of magnitude, is still unknown. We show that the 'six degrees of separation' are the property featured by the equilibrium state of any network where individuals weigh between their aspiration to improve their centrality and the costs incurred in forming and maintaining connections. We show, moreover, that the emergence of such a regularity is compatible with all other features, such as clustering and scale-freeness, that normally characterize the structure of social networks. Thus, our results show how simple evolutionary rules of the kind traditionally associated with human cooperation and altruism can also account for the emergence of one of the most intriguing attributes of social networks.

physics.soc-ph

Vector Centrality in Hypergraphs

Identifying the most influential nodes in networked systems is of vital importance to optimize their function and control. Several scalar metrics have been proposed to that effect, but the recent shift in focus towards network structures which go beyond a simple collection of dyadic interactions has rendered them void of performance guarantees. We here introduce a new measure of node's centrality, which is no longer a scalar value, but a vector with dimension one lower than the highest order of interaction in a hypergraph. Such a vectorial measure is linked to the eigenvector centrality for networks containing only dyadic interactions, but it has a significant added value in all other situations where interactions occur at higher-orders. In particular, it is able to unveil different roles which may be played by the same node at different orders of interactions -- information that is otherwise impossible to retrieve by single scalar measures. We demonstrate the efficacy of our measure with applications to synthetic networks and to three real world hypergraphs, and compare our results with those obtained by applying other scalar measures of centrality proposed in the literature.

physics.soc-ph