Related papers: Minimum Weight Dynamo and Fast Opinion Spreading

In this paper, we study the information propagation in an empirical blogging network by game-theoretical approach. The blogging network has small-world property and is scale-free. Individuals in the blogosphere coordinate their decisions…

We derive the mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks. These equations are solved numerically by means of a stochastic approach. First, we present…

We study growing networks in which each link carries a certain weight (randomly assigned at birth and fixed thereafter). The weight of a node is defined as the sum of the weights of the links attached to the node, and the network grows via…

We study a majority based preference diffusion model in which the members of a social network update their preferences based on those of their connections. Consider an undirected graph where each node has a strict linear order over a set of…

A simple model is proposed to simulate the evolution of interpersonal relationships in a class. The small social network is simply assumed as an undirected and weighted graph, in which students are represented by vertices, and the extent of…

In this note we make some specific observations on the distribution of the degree of a given vertex in certain model of randomly growing networks. The rule for network growth is the following. Starting with an initial graph of minimum…

We investigate opinion dynamics in multi-agent networks when a bias toward one of two possible opinions exists; for example, reflecting a status quo vs a superior alternative. Starting with all agents sharing an initial opinion representing…

This paper examines the interplay of opinion exchange dynamics and communication network formation. An opinion formation procedure is introduced which is based on an abstract representation of opinions as $k$--dimensional bit--strings.…

The dynamical process of opinion formation within a model using a local majority opinion updating rule is studied numerically in networks with the small-world geometrical property. The network is one in which shortcuts are added to randomly…

In this paper, we propose a new model for continuous time opinion dynamics on an evolving network. As opposed to existing models, in which the network typically evolves by discretely adding or removing edges, we instead propose a model for…

We investigate the impact of noise and topology on opinion diversity in social networks. We do so by extending well-established models of opinion dynamics to a stochastic setting where agents are subject both to assimilative forces by their…

Push-Pull is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. In each round, every informed node sends the rumor to a random…

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…

Understanding spreading dynamics will benefit society as a whole in better preventing and controlling diseases, as well as facilitating the socially responsible information while depressing destructive rumors. In network-based spreading…

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…

We study transient behavior of gossip opinion dynamics, in which agents randomly interact pairwise over a weighted graph with two communities. Edges within a community have identical weights different from edge weights between communities.…

The process by which new ideas, innovations, and behaviors spread through a large social network can be thought of as a networked interaction game: Each agent obtains information from certain number of agents in his friendship neighborhood,…

Distributed average consensus is the main mechanism in algorithms for decentralized computation. In distributed average consensus algorithm each node has an initial state, and the goal is to compute the average of these initial states in…

The present work analyses a particular scenario of consensus formation, where the individuals navigate across an underlying network defining the topology of the walks. The consensus, associated to a given opinion coded as a simple messages,…

We are proposing two greedy and a new linear programming based approximation algorithm for the total positive influence dominating set problem in weighted networks. Applications of this problem in weighted settings include finding: a…