Related papers: Bounds on the Voter Model in Dynamic Networks
We study the evolution of opinions (or beliefs) over a social network modeled as a signed graph. The sign attached to an edge in this graph characterizes whether the corresponding individuals or end nodes are friends (positive links) or…
We study a binary dynamical process that is a representation of the voter model with opinion makers. The process models an election with two candidates but can also describe the frequencies of a biallelic gene in a population or atoms with…
We investigate the problem of recovering a latent directed Erd\H{o}s-R\'enyi graph $G^*\sim \mathcal G(n,p)$ from observations of discrete voter model trajectories on $G^*$, where $np$ grows polynomially in $n$. Given access to $M$…
We consider the problem of aggregating data in a dynamic graph, that is, aggregating the data that originates from all nodes in the graph to a specific node, the sink. We are interested in giving lower bounds for this problem, under…
Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and "trustful," and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups,…
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 consider Markovian dynamics on a typical realization of the so-called Directed Configuration Model (DCM), that is, a random directed graph with prescribed in- and out-degrees. In this random geometry, we study the meeting time of two…
We study the evolution of opinions on a directed network with community structure. Individuals update their opinions synchronously based on a weighted average of their neighbors' opinions, their own previous opinions, and external media…
We study a discrete-time consensus model in which agents iteratively update their states through interactions on a dynamic social network. At each step, a single agent is selected asynchronously and averages the values of its current…
Dynamic graph learning equips the edges with time attributes and allows multiple links between two nodes, which is a crucial technology for understanding evolving data scenarios like traffic prediction and recommendation systems. Existing…
Non-linear voter models assume that the opinion of an agent depends on the opinions of its neighbors in a non-linear manner. This allows for voting rules different from majority voting. While the linear voter model is known to reach…
Given a graph $G$ of $n$ vertices, where each vertex is initially attached an opinion of either red or blue. We investigate a random process known as the Best-of-three voting. In this process, at each time step, every vertex chooses three…
This paper is concerned with the probability of consensus in a multivariate, spatially explicit version of the Hegselmann-Krause model for the dynamics of opinions. Individuals are located on the vertices of a finite connected graph…
Two of the main factors shaping an individual's opinion are social coordination and personal preferences, or personal biases. To understand the role of those and that of the topology of the network of interactions, we study an extension of…
Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If it doesn't have $k$ neighbours, it simply polls all of them,…
Several algorithms in prior literature have been proposed which guarantee consensus of normally behaving agents in a network that may contain adversarially behaving agents. These algorithms guarantee that the consensus value lies within the…
An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…
We consider voter dynamics on a directed adaptive network with fixed out-degree distribution. A transition between an active phase and a fragmented phase is observed. This transition is similar to the undirected case if the networks are…
We consider the quantized consensus problem on undirected time-varying connected graphs with n nodes, and devise a protocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of each network…
We study a family online influence maximization problems where in a sequence of rounds $t=1,\ldots,T$, a decision maker selects one from a large number of agents with the goal of maximizing influence. Upon choosing an agent, the decision…