Related papers: Bounds on the Voter Model in Dynamic Networks
We observe the outcome of the discrete time noisy voter model at a single vertex of a graph. We show that certain pairs of graphs can be distinguished by the frequency of repetitions in the sequence of observations. We prove that this…
Consider a graph $G$ and an initial configuration where each node is black or white. Assume that in each round all nodes simultaneously update their color based on a predefined rule. One can think of graph $G$ as a social network, where…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
Reasoning about graphs evolving over time is a challenging concept in many domains, such as bioinformatics, physics, and social networks. We consider a common case in which edges can be short term interactions (e.g., messaging) or long term…
In this paper we investigate the model of opinion dynamics with anticonformity on a complete graph. We show that below some threshold value of anticonformal behavior spontaneous reorientations occur between two stable states. Dealing with a…
Given a transition matrix $P$ indexed by a finite set $V$ of vertices, the voter model is a discrete-time Markov chain in $\{0,1\}^V$ where at each time-step a randomly chosen vertex $x$ imitates the opinion of vertex $y$ with probability…
We study the consensus formation for an agents based model, generalizing that originally proposed by Krause \cite{Kr}, by allowing the communication channels between any couple of agents to be switched on or off randomly, at each time step,…
We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
We investigate opinion dynamics and information spreading on networks under the influence of content filtering technologies. The filtering mechanism, present in many online social platforms, reduces individuals' exposure to disagreeing…
We present a mathematical description of the voter model dynamics on heterogeneous networks. When the average degree of the graph is $\mu \leq 2$ the system reaches complete order exponentially fast. For $\mu >2$, a finite system falls,…
We establish average consensus on graphs with dynamic topologies prescribed by evolutionary games among strategic agents. Each agent possesses a private reward function and dynamically decides whether to create new links and/or whether to…
Consider the following asynchronous, opportunistic communication model over a graph $G$: in each round, one edge is activated uniformly and independently at random and (only) its two endpoints can exchange messages and perform local…
We study the consensus problem in a synchronous distributed system of $n$ nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the…
The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this "deterministic random walk" covers all…
The voter model and the Axelrod model are two of the main stochastic processes that describe the spread of opinions on networks. The former includes social influence, the tendency of individuals to become more similar when they interact,…
This article deals with the consensus problem involving agents with time-varying singularities in the dynamics or communication in undirected graph networks. Existing results provide control laws which guarantee asymptotic consensus. These…
This paper considers a social network modeled as an Erdos Renyi random graph. Each individual in the network updates her opinion using the weighted average of the opinions of her neighbors. We explore how an external manipulative agent can…
The voter model consists of a set of agents whose opinion is a binary variable. At each time step, an agent along with a social neighbor is selected and the agent imitates the social neighbor at the next time step. In this paper, we study a…
In this paper, we formulate and investigate a generalized consensus algorithm which makes an attempt to unify distributed averaging and maximizing algorithms considered in the literature. Each node iteratively updates its state as a…