Name
Abstract | ||
|---|---|---|
We study asymptotic dynamical patterns that emerge among a set of nodes that interact in a dynamically evolving signed random network. Node interactions take place at random on a sequence of deterministic signed graphs. Each node receives positive or negative recommendations from its neighbors depending on the sign of the interaction arcs, and updates its state accordingly. Positive recommendations follow the standard consensus update while two types of negative recommendations, each modeling a different type of antagonistic or malicious interaction, are considered. Nodes may weigh positive and negative recommendations differently, and random processes are introduced to model the time-varying attention that nodes pay to the positive and negative recommendations. Various conditions for almost sure convergence, divergence, and clustering of the node states are established. Some fundamental similarities and differences are established for the two notions of negative recommendations. |
Year | Venue | Field |
|---|---|---|
2013 | arXiv: Social and Information Networks | Graph,Convergence of random variables,Random graph,Computer science,Stochastic process,Artificial intelligence,Cluster analysis,Machine learning,Consensus dynamics |
DocType | Volume | Citations |
Journal | abs/1309.5488 | 1 |
PageRank | References | Authors |
0.38 | 16 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| guodong shi | 1 | 711 | 54.50 |
| Alexandre Proutiere | 2 | 558 | 40.94 |
| mikael johansson | 3 | 1612 | 147.94 |
| John S. Baras | 4 | 1953 | 257.50 |
| Karl Henrik Johansson | 5 | 3996 | 322.75 |