The dynamics of rumor spreading is investigated using a model with three kinds of agents who are, respectively, the Seeds, the Agnostics, and the Others. While Seeds are the ones who start spreading the rumor being adamantly convinced of its truth, Agnostics reject any kind of rumor and do not believe in conspiracy theories. In between, the Others constitute the main part of the community. While Seeds are always Believers and Agnostics are always Indifferents, Others can switch between being Believer and Indifferent depending on who they are discussing with. The underlying driving dynamics is implemented via local updates of randomly formed groups of agents. In each group, an Other turns into a Believer as soon as or more Believers are present in the group. However, since some Believers may lose interest in the rumor as time passes by, we add a flipping fixed rate from Believers into Indifferents. Rigorous analysis of the associated dynamics reveals that switching from to triggers a drastic qualitative change in the spreading process. When , even a small group of Believers may manage to convince a large part of the community very quickly. In contrast, for , even a substantial fraction of Believers does not prevent the rumor dying out after a few update rounds. Our results provide an explanation on why a given rumor spreads within a social group and not in another and also why some rumors will not spread in neither groups.
Critical nodes in networks are extremely vulnerable to malicious attacks to trigger negative cascading events such as the spread of misinformation and diseases. Therefore, effective moderation of critical nodes is very vital for mitigating the potential damages caused by such malicious diffusions. The current moderation methods are computationally expensive. Furthermore, they disregard the fundamental metric of information centrality, which measures the dissemination power of nodes. We investigate the problem of removing k edges from a network to minimize the information centrality of a target node v while preserving the network's connectivity. We prove that this problem is computationally challenging: it is NP-complete and its objective function is not supermodular. However, we propose three approximation greedy algorithms using novel techniques such as random walk-based Schur complement approximation and fast sum estimation. One of our algorithms runs in nearly linear time in the number of edges. To complement our theoretical analysis, we conduct a comprehensive set of experiments on synthetic and real networks with over one million nodes. Across various settings, the experimental results illustrate the effectiveness and efficiency of our proposed algorithms.
11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Influence maximization is a key topic in data mining, with broad applications in social network analysis and viral marketing. In recent years, researchers have increasingly turned to machine learning techniques to address this problem. By learning the underlying diffusion processes from data, these methods improve the generalizability of solutions while optimizing objectives to identify the optimal seed set for maximizing influence. Nonetheless, two fundamental challenges remain unresolved: (1) While Graph Neural Networks (GNNs) are increasingly employed to learn diffusion models, their traditional architectures often fail to capture the complex dynamics of influence diffusion, (2) Designing optimization objectives is inherently difficult due to the combinatorial explosion associated with solving this problem. To address these challenges, we propose a novel framework, DeepSN. Our framework employs sheaf neural diffusion to learn diverse influence patterns in a data-driven, end-to-end manner, providing enhanced separability in capturing diffusion characteristics. We also propose an optimization technique that accounts for overlapping influence between vertices, significantly reducing the search space and facilitating the identification of the optimal seed set efficiently. Finally, we conduct extensive experiments on both synthetic and real-world datasets to demonstrate the effectiveness of our framework.
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 opinion on a new product or a topic. In each discrete-time round, all nodes are assigned randomly to groups of different sizes, where the node(s) in each group form a clique in the underlying graph. All the nodes simultaneously update their color to the majority color in their group. If there is a tie, each node in the group chooses one of the two colors uniformly at random. Investigating the convergence time of the model, our experiments show that the convergence time is a logarithm function of the number of nodes for a complete graph and a quadratic function for a cycle graph. We also study the various strategies for selecting a set of seed nodes to maximize the final cascade of one of the two colors, motivated by viral marketing. We consider the algorithms where the seed nodes are selected based on the graph structure (nodes’ centrality measures such as degree, betweenness, and closeness) and the individual’s characteristics (activeness and stubbornness). We provide a comparison of such strategies by conducting experiments on different real-world and synthetic networks.