English
Related papers

Related papers: Phase transition and information cascade in a voti…

200 papers

This study discusses choice behavior using a voting model in which voters can obtain information from a finite number of previous $r$ voters. Voters vote for a candidate with a probability proportional to the previous vote ratio, which is…

Physics and Society · Physics 2018-02-14 Masato Hisakado , Fumiaki Sano , Shintaro Mori

We consider the two-opinion voter model on a regular random graph with n vertices and degree $d \geq 3$. It is known that consensus is reached on time scale n and that on this time scale the volume of the set of vertices with one opinion…

We study binary opinion dynamics in a fully connected network of interacting agents. The agents are assumed to interact according to one of the following rules: (1) Voter rule: An updating agent simply copies the opinion of another randomly…

Probability · Mathematics 2022-03-04 Arpan Mukhopadhyay , Ravi R. Mazumdar , Rahul Roy

The voter model is a paradigm of ordering dynamics. At each time step, a random node is selected and copies the state of one of its neighbors. Traditionally, this state has been considered as a binary variable. Here, we relax this…

Statistical Mechanics · Physics 2015-06-05 Michele Starnini , Andrea Baronchelli , Romualdo Pastor-Satorras

In an election, we are given a set of voters, each having a preference list over a set of candidates, that are distributed on a social network. We consider a scenario where voters may change their preference lists as a consequence of the…

Social and Information Networks · Computer Science 2020-06-01 Mohammad Abouei Mehrizi , Gianlorenzo D'Angelo

Consider the following process on a network: Each agent initially holds either opinion blue or red; then, in each round, each agent looks at two random neighbors and, if the two have the same opinion, the agent adopts it. This process is…

Social and Information Networks · Computer Science 2020-11-17 Emilio Cruciani , Emanuele Natale , André Nusser , Giacomo Scornavacca

We introduce a bottleneck method for learning data representations based on information deficiency, rather than the more traditional information sufficiency. A variational upper bound allows us to implement this method efficiently. The…

Information Theory · Computer Science 2020-11-05 Pradeep Kr. Banerjee , Guido Montúfar

We present a novel model for the effect of echo chambers, filter bubbles, and reinforcement on election results. Our model extends the well known voter model with zealots to include reinforcement. We analyze the behaviour of the model,…

Physics and Society · Physics 2020-07-09 Johannes Müller , Volker Hösel , Aurélien Tellier

We propose a new single-winner election method ("Schulze method") and prove that it satisfies many academic criteria (e.g. monotonicity, reversal symmetry, resolvability, independence of clones, Condorcet criterion, k-consistency,…

Computer Science and Game Theory · Computer Science 2025-10-28 Markus Schulze

We study the voter model and related random-copying processes on arbitrarily complex network structures. Through a representation of the dynamics as a particle reaction process, we show that a quantity measuring the degree of order in a…

Statistical Mechanics · Physics 2015-05-19 R. A. Blythe

Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all votes. However, in many real-world settings votes come in sequentially, and the briber may have a…

Computer Science and Game Theory · Computer Science 2021-10-26 Edith Hemaspaandra , Lane A. Hemaspaandra , Joerg Rothe

We investigate the problem of computing the probability of winning in an election where voter attendance is uncertain. More precisely, we study the setting where, in addition to a total ordering of the candidates, each voter is associated…

Computer Science and Game Theory · Computer Science 2021-02-01 Aviram Imber , Benny Kimelfeld

Our main contribution is the introduction of the map of elections framework. A map of elections consists of three main elements: (1) a dataset of elections (i.e., collections of ordinal votes over given sets of candidates), (2) a way of…

The voter model is an archetypal stochastic process that represents opinion dynamics. In each update, one agent is chosen uniformly at random. The selected agent then copies the current opinion of a randomly selected neighbour. We…

Physics and Society · Physics 2020-11-20 Michael T. Gastner , Kota Ishida

We consider the problem of predicting winners in elections, for the case where we are given complete knowledge about all possible candidates, all possible voters (together with their preferences), but where it is uncertain either which…

Computer Science and Game Theory · Computer Science 2016-03-27 Krzysztof Wojtas , Krzysztof Magiera , Tomasz Miąsko , Piotr Faliszewski

Phase-transition phenomena in deep learning (grokking, emergent capabilities, and ontological reorganization under context shift) have been studied through several lenses, including representational compression, singular learning theory,…

Machine Learning · Computer Science 2026-05-19 Truong Xuan Khanh

In real-world systems, phase transitions often materialize abruptly, making it difficult to design appropriate controls that help uncover underlying processes. Some agent-based computational models display transformations similar to phase…

Physics and Society · Physics 2018-10-10 S. S. Chanda , B. McKelvey

Competition between varying ideas, people and institutions fuels the dynamics of socio-economic systems. Numerous analyses of the empirical data extracted from different financial markets have established a consistent set of stylized facts…

Physics and Society · Physics 2018-10-17 A. Kononovicius

In the Information Bottleneck (IB), when tuning the relative strength between compression and prediction terms, how do the two terms behave, and what's their relationship with the dataset and the learned representation? In this paper, we…

Machine Learning · Computer Science 2020-01-08 Tailin Wu , Ian Fischer

Most social choice rules assume access to full rankings, while current alignment practice -- despite aiming for diversity -- typically treats voters as anonymous and comparisons as independent, effectively extracting only about one bit per…

Computer Science and Game Theory · Computer Science 2026-03-23 Luise Ge , Daniel Halpern , Gregory Kehne , Yevgeniy Vorobeychik
‹ Prev 1 4 5 6 7 8 10 Next ›