随机$K_k$删除算法
Random $K_k$-removal algorithm
摘要:
一个有趣的问题是图如何从一些受约束的随机图过程发展而来,这是动态网络形成和演化的基本机制。这里的问题是指随机$K_k$删除算法。对于一个固定的整数$k\geqslant 3$,它从$n\rightarrow\infty$顶点上的完全图开始,并迭代地删除均匀选择的$K_k$的边。该算法在没有$K_k$时终止,同时生成一个线性$k$ -一致超图.对于$k=3$,已表明最终图中的大小为$n^{3/2+o(1)}$。$k\geqslant 4$的病例结果较少。在本文中,我们证明了算法中的各种关键参数的精确期望轨迹到一些迭代,使得算法中的最终大小最多为$n^{2-1/(k(k-1)-2)+o(1)}$对于$k\geqslant 4$。我们还证明了边界是一个天然屏障。
英文摘要:
One interesting question is how a graph develops from some constrained random graph process, which is a fundamental mechanism in the formation and evolution of dynamic networks. The problem here is referred to the random $K_k$-removal algorithm. For a fixed integer $k\geqslant 3$, it starts with a complete graph on $n\rightarrow\infty$ vertices and iteratively removes the edges of an uniformly chosen $K_k$. This algorithm terminates once no $K_k$s remain and at the same time it generates one linear $k$-uniform hypergraph. For $k=3$, it was shown that the size in the final graph is $n^{3/2+o(1)}$. Less results are on the cases when $k\geqslant 4$. In this paper, we prove that the exact expected trajectories of various key parameters in the algorithm to some iteration such that the final size in the algorithm is at most $n^{2-1/(k(k-1)-2)+o(1)}$ for $k\geqslant 4$. We also show the bound is a natural barrier.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。