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

随机图的鲁棒控制

Robust Domination in Random Graphs

Ghurumuruhan Ganesan

摘要:

在本文中,我们研究了随机图的“鲁棒”控制集,即使一个小的\emph{deterministic}集的边缘被删除,仍然保持控制属性。我们激励我们的研究,说明与恶劣环境中的无线网络的例子。然后利用概率方法和鞅差技巧确定了鲁棒控制数渐近最优的充分条件。我们还讨论了稀疏随机图中的鲁棒控制,其中边的数量最多线性增长的顶点数。

英文摘要:

In this paper, we study "robust" dominating sets of random graphs that retain the domination property even if a small \emph{deterministic} set of edges are removed. We motivate our study by illustrating with examples from wireless networks in harsh environments. We then use the probabilistic method and martingale difference techniques to determine sufficient conditions for the asymptotic optimality of the robust domination number. We also discuss robust domination in sparse random graphs where the number of edges grows at most linearly in the number of vertices.

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

↑