Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLack of consensus in social systems
116
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We propose an exactly solvable model for the dynamics of voters in a two-party system. The opinion formation process is modeled on a random network of agents. The dynamical nature of interpersonal relations is also reflected in the model, as the connections in the network evolve with the dynamics of the voters. In the infinite time limit, an exact solution predicts the emergence of consensus, for arbitrary initial conditions. However, before consensus is reached, two different metastable states can persist for exponentially long times. One state reflects a perfect balancing of opinions, the other reflects a completely static situation. An estimate of the associated lifetimes suggests that lack of consensus is typical for large systems.
rate research
Read More
We show how the prevailing majority opinion in a population can be rapidly reversed by a small fraction p of randomly distributed committed agents who consistently proselytize the opposing opinion and are immune to influence. Specifically, we show that when the committed fraction grows beyond a critical value p_c approx 10%, there is a dramatic decrease in the time, T_c, taken for the entire population to adopt the committed opinion. In particular, for complete graphs we show that when p < p_c, T_c sim exp(alpha(p)N), while for p > p_c, T_c sim ln N. We conclude with simulation results for ErdH{o}s-Renyi random graphs and scale-free networks which show qualitatively similar behavior.
We consider a model of power distribution in a social system where a set of agents play a simple game on a graph: the probability of winning each round is proportional to the agents current power, and the winner gets more power as a result. We show that, when the agents are distributed on simple 1D and 2D networks, inequality grows naturally up to a certain stationary value characterized by a clear division between a higher and a lower class of agents. High class agents are separated by one or several lower class agents which serve as a geometrical barrier preventing further flow of power between them. Moreover, we consider the effect of redistributive mechanisms, such as proportional (non-progressive) taxation. Sufficient taxation will induce a sharp transition towards a more equal society, and we argue that the critical taxation level is uniquely determined by the system geometry. Interestingly, we find that the roughness and Shannon entropy of the power distributions are a very useful complement to the standard measures of inequality, such as the Gini index and the Lorenz curve.
The dynamics of individuals is of essential importance for understanding the evolution of social systems. Most existing models assume that individuals in diverse systems, ranging from social networks to e-commerce, all tend to what is already popular. We develop an analytical time-aware framework which shows that when individuals make choices -- which item to buy, for example -- in online social systems, a small fraction of them is consistently successful in discovering popular items long before they actually become popular. We argue that these users, whom we refer to as discoverers, are fundamentally different from the previously known opinion leaders, influentials, and innovators. We use the proposed framework to demonstrate that discoverers are present in a wide range of systems. Once identified, they can be used to predict the future success of items. We propose a network model which reproduces the discovery patterns observed in the real data. Furthermore, data produced by the model pose a fundamental challenge to classical ranking algorithms which neglect the time of link creation and thus fail to discriminate between discoverers and ordinary users in the data. Our results open the door to qualitative and quantitative study of fine temporal patterns in social systems and have far-reaching implications for network modeling and algorithm design.
We investigate different opinion formation models on adaptive network topologies. Depending on the dynamical process, rewiring can either (i) lead to the elimination of interactions between agents in different states, and accelerate the convergence to a consensus state or break the network in non-interacting groups or (ii) counter-intuitively, favor the existence of diverse interacting groups for exponentially long times. The mean-field analysis allows to elucidate the mechanisms at play. Strikingly, allowing the interacting agents to bear more than one opinion at the same time drastically changes the models behavior and leads to fast consensus.
We introduce a socially motivated extension of the voter model in which individual voters are also influenced by two opposing, fixed-opinion news sources. These sources forestall consensus and instead drive the population to a politically polarized state, with roughly half the population in each opinion state. Two types social networks for the voters are studied: (a) the complete graph of $N$ voters and, more realistically, (b) the two-clique graph with $N$ voters in each clique. For the complete graph, many dynamical properties are soluble within an annealed-link approximation, in which a link between a news source and a voter is replaced by an average link density. In this approximation, we show that the average consensus time grows as $N^alpha$, with $alpha = pell/(1-p)$. Here $p$ is the probability that a voter consults a news source rather than a neighboring voter, and $ell$ is the link density between a news source and voters, so that $alpha$ can be greater than 1. The polarization time, namely, the time to reach a politically polarized state from an initial strong majority state, is typically much less than the consensus time. For voters on the two-clique graph, either reducing the density of interclique links or enhancing the influence of news sources again promotes polarization.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
