相关论文: Voter Model on Heterogeneous Graphs
This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. Describing a consensus protocol as a graph spectrum filter, we present an effective new approach to the analysis and design of consensus…
In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly…
We study a graph-based generalization of the Galam opinion formation model. Consider a simple connected graph which represents a social network. Each node in the graph is colored either blue or white, which indicates a positive or negative…
Average consensus (AC) strategies play a key role in every system that employs cooperation by means of distributed computations. To promote consensus, an $N$-agent network can repeatedly combine certain node estimates until their mean value…
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…
In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for…
Consider a distributed graph where each vertex holds one of two distinct opinions. In this paper, we are interested in synchronous voting processes where each vertex updates its opinion according to a predefined common local updating rule.…
We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules.…
We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by B\' en\' ezit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two…
We study analytically the ordering kinetics of the two-dimensional long-range voter model on a two-dimensional lattice, where agents on each vertex take the opinion of others at distance $r$ with probability $P(r) \propto r^{-\al}$. The…
We investigate coarsening and persistence in the voter model by introducing the quantity $P_n(t)$, defined as the fraction of voters who changed their opinion n times up to time t. We show that $P_n(t)$ exhibits scaling behavior that…
In this paper, we analyze the limiting spectral distribution of the adjacency matrix of a random graph ensemble, proposed by Chung and Lu, in which a given expected degree sequence $\overline{w}_n^{^{T}} = (w^{(n)}_1,\ldots,w^{(n)}_n)$ is…
A broad range of dynamical systems involve multi-body interactions, or group interactions, which may not be encoded in traditional graphical structures. In this work, we focus on a canonical example from opinion dynamics, the Majority Rule,…
Merit based promotion & tenure decision have always been controversial. This paper suggests an agent based model of the decision making processs using spectral graph theory, where the voting agents are the vertices of the graph, and edge…
A discrete-time modulus consensus model is considered in which the interaction among a family of networked agents is described by a time-dependent gain graph whose vertices correspond to agents and whose arcs are assigned complex numbers…
This article presents a novel approach for learning low-dimensional distributed representations of users in online social networks. Existing methods rely on the network structure formed by the social relationships among users to extract…
This paper investigates some aspects of a recently proposed nonlinear mathematical model of opinion dynamics. The main objective is to identify the network structures that maximize the average equilibrium opinion (HMO). We prove that…
Let $H_n$ be a graph on $n$ vertices and let $\ber{H_n}$ denote the complement of $H_n$. Suppose that $\Delta = \Delta(n)$ is the maximum degree of $\ber{H_n}$. We analyse three algorithms for sampling $d$-regular subgraphs ($d$-factors) of…
We introduce a homogeneous pair approximation to the Naming Game (NG) model by deriving a six-dimensional ODE for the two-word Naming Game. Our ODE reveals the change in dynamical behavior of the Naming Game as a function of the average…
Graph mining is an important technique that used in many applications such as predicting and understanding behaviors and information dissemination within networks. One crucial aspect of graph mining is the identification and ranking of…