相依随机图与多方指针跳跃
Dependent Random Graphs and Multiparty Pointer Jumping
摘要:
我们开始研究一个宽松的版本的标准Erdos-Renyi随机图模型,其中每个边缘可能取决于其他几个边缘。我们称这样的图为“相依随机图”。我们在这个方向上的主要结果是一个彻底的了解团数的依赖随机图。我们还得到了色数的界。令人惊讶的是,随机图的许多标准性质在这种宽松的环境中也成立。我们证明了一个依赖随机图以很高的概率包含一个大小为$\frac{(1-o(1))\log n}{\log(1/p)}$的团,并且色数至多为$\frac{n \log(1/1-p)}{\log n}$。作为应用和第二个主要结果,我们给出了一个新的通信协议的k-玩家多方指针跳跃(MPJ_k)问题的额头上的数字(NOF)模型。多方指针跳跃是典型的NOF通信问题之一,但即使对于三个参与者,其通信复杂性也没有得到很好的理解。我们的MPJ_3协议消耗了$O(\frac{n\log\log n}{\log n})$通信,改进了Brody和Chakrabarti的边界[BC 08]。我们将我们的协议扩展到非布尔指针跳跃问题$\widehat{MPJ}_k$,实现了一个上限是O(n)的任何$k >= 4$球员。这是$\widehat{MPJ}_k$的第一个o(n)界,并且改进了Damm,Jukna和Sgall [DJS 98]的界,该界已经存在了近20年。
英文摘要:
We initiate a study of a relaxed version of the standard Erdos-Renyi random graph model, where each edge may depend on a few other edges. We call such graphs "dependent random graphs". Our main result in this direction is a thorough understanding of the clique number of dependent random graphs. We also obtain bounds for the chromatic number. Surprisingly, many of the standard properties of random graphs also hold in this relaxed setting. We show that with high probability, a dependent random graph will contain a clique of size $\frac{(1-o(1))\log n}{\log(1/p)}$, and the chromatic number will be at most $\frac{n \log(1/1-p)}{\log n}$. As an application and second main result, we give a new communication protocol for the k-player Multiparty Pointer Jumping (MPJ_k) problem in the number-on-the-forehead (NOF) model. Multiparty Pointer Jumping is one of the canonical NOF communication problems, yet even for three players, its communication complexity is not well understood. Our protocol for MPJ_3 costs $O(\frac{n\log\log n}{\log n})$ communication, improving on a bound of Brody and Chakrabarti [BC08]. We extend our protocol to the non-Boolean pointer jumping problem $\widehat{MPJ}_k$, achieving an upper bound which is o(n) for any $k >= 4$ players. This is the first o(n) bound for $\widehat{MPJ}_k$ and improves on a bound of Damm, Jukna, and Sgall [DJS98] which has stood for almost twenty years.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。