arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.07316math.COcs.DM
收藏

加权迫零传播时间

Propagation time for weighted zero forcing

P. A. CrowdMath

摘要:

迫零是一种图着色过程,它被定义为一种确定图的最小秩和最大零度的工具。它还被用于研究量子系统的控制和监测电力网络。2017年AIM研讨会“零强制及其应用”的问题之一是探索边加权概率零强制,其中边具有权重,如果在标准零强制着色规则下强制是可能的,则确定成功力的概率。在本文中,我们调查的期望时间完成加权迫零着色过程,被称为预期的传播时间,以及该过程的时间完成的概率至少为$α$,被称为$α$ -置信传播时间。我们演示了如何使用马尔可夫矩阵找到任何边加权图的预期和置信传播时间。我们还确定了预期的和置信度的传播时间为各种家庭的边缘加权图,包括完全图,明星,路径和周期。

英文摘要:

Zero forcing is a graph coloring process that was defined as a tool for bounding the minimum rank and maximum nullity of a graph. It has also been used for studying control of quantum systems and monitoring electrical power networks. One of the problems from the 2017 AIM workshop "Zero forcing and its applications" was to explore edge-weighted probabilistic zero forcing, where edges have weights that determine the probability of a successful force if forcing is possible under the standard zero forcing coloring rule. In this paper, we investigate the expected time to complete the weighted zero forcing coloring process, known as the expected propagation time, as well as the time for the process to be completed with probability at least $α$, known as the $α$-confidence propagation time. We demonstrate how to find the expected and confidence propagation times of any edge-weighted graph using Markov matrices. We also determine the expected and confidence propagation times for various families of edge-weighted graphs including complete graphs, stars, paths, and cycles.

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

↑