社交网络中的多数投票:随机交友还是固执地压倒精英
Majority Vote in Social Networks: Make Random Friends or Be Stubborn to Overpower Elites
摘要:
考虑一个图$G$,表示一个社交网络。假设最初每个节点被着色为黑色或白色,这对应于关于消费产品或技术创新的积极或消极意见。在多数模型中,在每一轮中,所有节点同时将其颜色更新为其连接中最频繁的颜色。对来自真实世界社交网络(SN)的图形数据的实验表明,如果在一个非常小的高度节点集合中的所有节点(通常被称为精英)都同意一种颜色,则该颜色在该过程结束时成为主导颜色。我们提出了两个对策,可以通过个别节点相对容易地,并保证精英将不会有这种不成比例的权力,工程师的主导输出颜色。第一个对策基本上要求每个节点随机建立一些新的连接,而第二个对策要求节点更不愿意改变它们的颜色(意见)。我们从理论和实验上验证了它们的有效性和正确性。我们还研究了多数模型和它的一个变体时,初始着色是随机的现实世界的SN和几个随机图模型。特别是,我们的Erdens-Rényi和定期随机图的结果证实或支持一些理论发现或先前的工作有关的阈值行为的过程。最后,我们提供了理论和实验证据的多数模型的预期稳定时间的存在多对数界。
英文摘要:
Consider a graph $G$, representing a social network. Assume that initially each node is colored either black or white, which corresponds to a positive or negative opinion regarding a consumer product or a technological innovation. In the majority model, in each round all nodes simultaneously update their color to the most frequent color among their connections. Experiments on the graph data from the real world social networks (SNs) suggest that if all nodes in an extremely small set of high-degree nodes, often referred to as the elites, agree on a color, that color becomes the dominant color at the end of the process. We propose two countermeasures that can be adopted by individual nodes relatively easily and guarantee that the elites will not have this disproportionate power to engineer the dominant output color. The first countermeasure essentially requires each node to make some new connections at random while the second one demands the nodes to be more reluctant towards changing their color (opinion). We verify their effectiveness and correctness both theoretically and experimentally. We also investigate the majority model and a variant of it when the initial coloring is random on the real world SNs and several random graph models. In particular, our results on the Erdős-Rényi and regular random graphs confirm or support several theoretical findings or conjectures by the prior work regarding the threshold behavior of the process. Finally, we provide theoretical and experimental evidence for the existence of a poly-logarithmic bound on the expected stabilization time of the majority model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。