Related papers: Bounds on the Voter Model in Dynamic Networks
The diffusion of opinions in Social Networks is a relevant process for adopting positions and attracting potential voters in political campaigns. Opinion polarization, bias, targeted diffusion, and the radicalization of postures are key…
This paper is about a new model of opinion dynamics with opinion-dependent connectivity. We assume that agents update their opinions asynchronously and that each agent's new opinion depends on the opinions of the $k$ agents that are closest…
In this paper we study a discrete time consensus model on a connected graph with monotonically increasing peer-pressure and noise perturbed outputs masking a hidden state. We assume that each agent maintains a constant hidden state and a…
We study opinion dynamics over multiplex networks where agents interact with bounded confidence. Namely, two neighbouring individuals exchange opinions and compromise if their opinions do not differ by more than a given threshold. In…
We study two agent based models of opinion formation - one stochastic in nature and one deterministic. Both models are defined in terms of an underlying graph; we study how the structure of the graph affects the long time behavior of the…
We investigate a nonlinear version of coevolving voter models, in which node states and network structure update as a coupled stochastic dynamical process. Most prior work on coevolving voter models has focused on linear update rules with…
We introduce a model for innovation-, evolution- and opinion dynamics whose spreading is dictated by unanimity rules, i.e. a node will change its (binary) state only if all of its neighbours have the same corresponding state. It is shown…
The understanding of how users in a network update their opinions based on their neighbours opinions has attracted a great deal of interest in the field of network science, and a growing body of literature recognises the significance of…
Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of $k$ distinct opinions, and at each step a random vertex alters its opinion to that of a randomly chosen neighbour. If the…
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of…
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…
Opinion dynamics aims to understand how individuals' opinions evolve through local interactions. Recently, opinion dynamics have been modeled as network games, where individuals update their opinions in order to minimize the social pressure…
In this paper, we study the {\sc Dominating Set} problem in random graphs. In a random graph, each pair of vertices are joined by an edge with a probability of $p$, where $p$ is a positive constant less than $1$. We show that, given a…
In recent years, opinion dynamics has received an increasing attention, and various models have been introduced and evaluated mainly by simulation. In this study, we introduce and study a dynamical model inspired by the so-called `bounded…
The inference of outcomes in dynamic processes from structural features of systems is a crucial endeavor in network science. Recent research has suggested a machine learning-based approach for the interpretation of dynamic patterns emerging…
We propose a consensus opinion model based on the evolutionary game. In our model, both of the two connected agents receive a benefit if they have the same opinion, otherwise they both pay a cost. Agents update their opinions by comparing…
A continuous-opinion model accounting for the social compromise propensity is theoretically and numerically analysed. An agent's opinion is represented by a real number that can be changed through social interactions with her neighbours.…
This paper concerns {\em randomized} leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete $n$-node networks that runs in O(1) rounds and (with high probability) uses only…
We study the behavior of a generalized consensus dynamics on a temporal network of interactions, the activity driven network with attractiveness. In this temporal network model, agents are endowed with an intrinsic activity $a$, ruling the…
Twin nodes in a static network capture the idea of being substitutes for each other for maintaining paths of the same length anywhere in the network. In dynamic networks, we model twin nodes over a time-bounded interval, noted…