如何冷却一个图
How to cool a graph
AI总结:
本文引入了受网络影响传播和燃烧数启发的新图参数“冷却数”以衡量缓慢传染病的传播速度,并通过图的阶与直径给出紧致界限,推导了笛卡尔网格的冷却数,且在社交网络模型中进行了研究。
摘要:
我们引入了一个新的图参数,称为冷却数(cooling number),其灵感来源于网络中影响的传播及其前身燃烧数(burning number)。冷却数衡量图中缓慢移动传染病的速度;冷却数越低,传染病传播得越快。我们通过图的阶和直径提供了冷却数的紧致界限。利用等周结果,我们推导了笛卡尔网格的冷却数。在由 Iterated Local Transitivity 模型生成的社交网络图中研究了冷却数。最后以开放问题作结。
英文摘要:
We introduce a new graph parameter called the cooling number, inspired by the spread of influence in networks and its predecessor, the burning number. The cooling number measures the speed of a slow-moving contagion in a graph; the lower the cooling number, the faster the contagion spreads. We provide tight bounds on the cooling number via a graph's order and diameter. Using isoperimetric results, we derive the cooling number of Cartesian grids. The cooling number is studied in graphs generated by the Iterated Local Transitivity model for social networks. We conclude with open problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。