arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1712.08712cs.SIcs.DS
收藏

随机生长树Jordan中心的持久性

Persistence of the Jordan center in Random Growing Trees

Sarath Pattathil, Nikhil Karamchandani, Dhruti Shah

摘要:

图的约当中心被定义为到图中其他节点的最大距离最小的顶点,它在设施定位和源检测问题中有应用。研究了随机生长树的Jordan中心的性质。特别地,我们考虑一个规则的树图,感染从根结点开始,然后根据各种随机传播模型沿图的边缘传播。对于独立级联(IC)模型和离散易感感染(SI)模型,这两个模型都是离散时间模型,我们表明,随着感染子图随时间的增长,约旦中心持续在一个单一的顶点后,有限数量的时间步。最后,我们还研究了SI模型的连续时间形式,并给出了任意时刻Jordan中心到根结点的最大距离的界。

英文摘要:

The Jordan center of a graph is defined as a vertex whose maximum distance to other nodes in the graph is minimal, and it finds applications in facility location and source detection problems. We study properties of the Jordan Center in the case of random growing trees. In particular, we consider a regular tree graph on which an infection starts from a root node and then spreads along the edges of the graph according to various random spread models. For the Independent Cascade (IC) model and the discrete Susceptible Infected (SI) model, both of which are discrete time models, we show that as the infected subgraph grows with time, the Jordan center persists on a single vertex after a finite number of timesteps. Finally, we also study the continuous time version of the SI model and bound the maximum distance between the Jordan center and the root node at any time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑