Learn More
A topic propagating in a social network reaches its tipping point if the number of users discussing it in the network exceeds a critical threshold such that a wide cascade on the topic is likely to occur. In this paper, we consider the task of selecting initial seed users of a topic with minimum size so that {\em with a guaranteed probability} the number of(More)
In this paper, we study distributed consensus in synchronous systems subject to both unexpected crash failures and strategic manipulations by rational agents in the system. We adapt the concept of collusion-resistant Nash equilibrium to model protocols that are resilient to both crash failures and strategic manipulations of a group of colluding agents. For(More)
—Social influence and influence diffusion has been widely studied in online social networks. However, most existing works on influence diffusion focus on static networks. In this paper, we study the problem of maximizing influence diffusion in a dynamic social network. Specifically, the network changes over time and the changes can be only observed by(More)
In computer networks and social networks, the betweenness centrality of a node measures the amount of information passing through the node when all pairs are conducting shortest path exchanges. In this paper, we introduce a strategic network formation game in which nodes build connections subject to a budget constraint in order to maximize their betweenness(More)
In this paper, we present two bounded cost algorithms that solve multivalued consensus using binary consensus instances. Our first algorithm uses log 2 n number of binary consensus instances where n is the number of processes, while our second algorithm uses at most 2 k binary consensus instances, where k is the maximum length of the binary representation(More)
In this paper, we propose the partition approach and define several new classes of partitioned failure detectors weaker than existing failure detectors for the k-set agreement problem in both the shared-memory model and the message-passing model. In the shared-memory model with n + 1 processes, for any 2 ≤ k ≤ n, we first propose a partitioned failure(More)
In a breakthrough result, Reingold [17] showed that the Undi-rected st-Connectivity problem can be solved in O(log n) space. The next major challenge in this direction is whether one can extend it to directed graphs, and thereby lowering the deterministic space complexity of RL or N L. In this paper, we show that Reingold's algorithm, the O(log 4/3 n)-space(More)
In this paper, we apply the partition approach proposed in [6] to study weak failure detectors for set agreement problem for the shared-memory model. In a system with n + 1 processes, for any 2 ≤ k ≤ n, we first propose a partitioned failure detector ΠΩ k that solves k-set agreement with shared read/write registers and is strictly weaker than Ω k , which(More)
When implementing multivalued consensus using binary consensus, previous algorithms assume the availability of uniform reliable broadcast, which is not implementable in systems with fair-lossy links. In this paper, we show that with binary consensus we can implement uniform reliable broadcast directly in systems with fair-lossy links, and thus the separate(More)