随机正则图的极小传染集
Minimal contagious sets in random regular graphs
摘要:
自举渗流(英语:Bootstrap percolation)是一个动态的过程,用来模拟一种流行病在图上的传播,如果不活跃的顶点的活跃邻居的数量达到某个阈值,那么它们就会变得活跃。我们研究了与之相关的优化问题,即确定初始配置中的最小数量的活性位点,从而导致在这种动态下激活整个图,有和没有完全激活所需的时间的约束。这个问题在特殊情况下包含了图的许多极值特征,如图的独立性、去循环性或控制数,也可以看作是排斥粒子的填充问题。我们使用的腔方法(包括复本对称性破缺的影响),统计力学的许多预测,其中的启发式技术已被严格证实,在最近几年。用这种方法,我们得到了关于大随机正则图中最小传染集的大小的几个定量结果,其中最引人注目的是激活阈值为3的5-正则随机图(分别为6-阈值为4的正则集)具有包含分数1/6的传染集(分别为1/4)的顶点总数。等价地,这些数字是必须从5-正则(分别为)中移除的顶点的最小分数。6-正则)随机图破坏其3-核。我们还研究了调查传播的算法程序来解决这个优化问题的随机正则图的单个实例。
英文摘要:
The bootstrap percolation (or threshold model) is a dynamic process modelling the propagation of an epidemic on a graph, where inactive vertices become active if their number of active neighbours reach some threshold. We study an optimization problem related to it, namely the determination of the minimal number of active sites in an initial configuration that leads to the activation of the whole graph under this dynamics, with and without a constraint on the time needed for the complete activation. This problem encompasses in special cases many extremal characteristics of graphs like their independence, decycling or domination number, and can also be seen as a packing problem of repulsive particles. We use the cavity method (including the effects of replica symmetry breaking), an heuristic technique of statistical mechanics many predictions of which have been confirmed rigorously in the recent years. We have obtained in this way several quantitative conjectures on the size of minimal contagious sets in large random regular graphs, the most striking being that 5-regular random graph with a threshold of activation of 3 (resp. 6-regular with threshold 4) have contagious sets containing a fraction 1/6 (resp. 1/4) of the total number of vertices. Equivalently these numbers are the minimal fraction of vertices that have to be removed from a 5-regular (resp. 6-regular) random graph to destroy its 3-core. We also investigated Survey Propagation like algorithmic procedures for solving this optimization problem on single instances of random regular graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。