复杂网络选民模型中的不和谐

超越个体影响：回音室与社区播种在多层三态q-投票模型中的作用

Beyond Individual Influence: The Role of Echo Chambers and Community Seeding in the Multilayer three state q-Voter Model

研究揭示多层三态q-投票模型中回音室与社区播种的影响机制，指出拓扑熵最大化优于局部集群强化，VoteRank在复杂传染中表现更优。

Heterogenous mean-field analysis of a generalized voter-like model on networks

We propose a generalized framework for the study of voter models in complex networks at the the heterogeneous mean-field (HMF) level that (i) yields a unified picture for existing copy/invasion processes and (ii) allows for the introduction of further heterogeneity through degree-selectivity rules. In the context of the HMF approximation, our model is capable of providing straightforward estimates for central quantities such as the exit probability and the consensus/fixation time, based on the statistical properties of the complex network alone. The HMF approach has the advantage of being read…

The noisy voter model on complex networks

We propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for uncorrelated networks, allowing to deal with the network structure as parametric heterogeneity. As an illustration, we study the noisy voter model, a modification of the original voter model including random changes of state. The proposed method is able to unfold the dependence of the model not only on the mean degree (the mean-field prediction) but also on more compl…

Zealotry and Influence Maximization in the Voter Model: When to Target Zealots?

In this paper, we study influence maximization in the voter model in the presence of biased voters (or zealots) on complex networks. Under what conditions should an external controller with finite budget who aims at maximizing its influence over the system target zealots? Our analysis, based on both analytical and numerical results, shows a rich diagram of preferences and degree-dependencies of allocations to zealots and normal agents varying with the budget. We find that when we have a large budget or for low levels of zealotry, optimal strategies should give larger allocations to zealots and…

Identifying a set of influential spreaders in complex networks

Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-$r$ ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and $k$-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effec…

Markov Chain Aggregation for Simple Agent-Based Models on Symmetric Networks: The Voter Model

For Agent Based Models, in particular the Voter Model (VM), a general framework of aggregation is developed which exploits the symmetries of the agent network $G$. Depending on the symmetry group $Aut_ω (N)$ of the weighted agent network, certain ensembles of agent configurations can be interchanged without affecting the dynamical properties of the VM. These configurations can be aggregated into the same macro state and the dynamical process projected onto these states is, contrary to the general case, still a Markov chain. The method facilitates the analysis of the relation between microscopi…

社交网络中的多数正确性：从完全混合选民群体到复杂网络

Majority Correctness in Social Networks: From Well-Mixed Electorates to Complex Networks

研究社交网络投票前社交互动下的多数正确性，基于狂热者 - 逆向选民模型，刻画了完全混合选民群体及不同网络的情况，建立有限选民群体的孔多塞型保证，发现聚合失败，揭示拓扑结构对投票相关性及多数准确性的影响。

超图上选民动力学中群体相互作用与非线性的竞争

Competition between group interactions and nonlinearity in voter dynamics on hypergraphs

针对超图上多元关系对社会动力学的影响，构建群体驱动选民模型（GVM），分析非线性与群体规模竞争，发现其共识达成速度更快且存在最优退出时间，揭示了该竞争对GVM动力学的塑造作用。

Identification of complex network topologies through delayed mutual information

The definitions of delayed mutual information and multi-information are recalled. It is shown how the delayed mutual information may be used to reconstruct the interaction topology resulting from some unknown scale-free graph with its associated local dynamics. Delayed mutual information is also used to solve the community detection problem. A probabilistic voter model defined on a scale-free graph is used throughout the paper as an illustrative example.

社交网络上的移位贿赂

Shift Bribery over Social Networks

研究社交网络中通过贿赂选民提升候选人排名的移位贿赂问题，证明其NP完全性并给出多种图结构下的多项式时间算法。