arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.1174math.CO
收藏

随机超图中的高阶相变

High-order Phase Transition in Random Hypergrpahs

Linyuan Lu, Xing Peng

摘要:

本文研究了随机$r$ -一致超图中的高阶相变。对于正整数$n$和实$p\in [0,1]$,设$H:=H^r(n,p)$是具有顶点集$[n]$的随机$r$ -一致超图,其中每个$r$ -集都是以概率$p$独立随机选择的边.对于$1\leq s \leq r-1$和两个$s$ -集$S$和$S'$,我们说$S$连接到$S'$,如果存在一个交替的$s$ -集和边$S_0,F_1,S_1,F_2, \ldots, F_k, S_k$的序列,使得$S_0,S_1,\ldots, S_k$是$s$ -集,$S_0=S$,$S_k=S'$,$F_1,F_2,\ldots, F_k$是$H$的边,并且对于每个$1\leq i\leq k$有$S_{i-1}\cup S_i\subseteq F_i$.这是在所有$s$ -集合${[n]\choose s}$的族上的等价关系,并导致划分:${V\choose s}=\cup_i C_i$。每个$C_i$称为{ $s$ -th-order}连通分支,如果$|C_i|=Θ(n^s)$,则分支$C_i$是{ \em giant}。证明了$H^r(n,p)$中$s$阶巨连通分支存在的锐阈值为$\frac{1}{\big({r\choose s}-1\big){n\choose r-s}}$ .让$c={n\choose r-s}p$。如果$c$是一个常数,并且是$c<\tfrac{1}{\binom{r}{s}-1}$,那么以很高的概率,所有$s$阶连通分量的大小都是$O(\ln n)$。如果$c$是一个常数,并且是$c > \tfrac{1}{\binom{r}{s}-1}$,那么以很高的概率,$H^r(n,p)$具有唯一的巨连通$s$阶分量,其大小是$(z+o(1)){n\choose s}$,其中$$z=1-\sum_{j=0}^\infty \frac{\left({r\choose s}j -j+1 \right)^{j-1}}{j!}c^je^{-c\left({r\choose s}j -j+1\right)}.$$

英文摘要:

In this paper, we study the high-order phase transition in random $r$-uniform hypergraphs. For a positive integer $n$ and a real $p\in [0,1]$, let $H:=H^r(n,p)$ be the random $r$-uniform hypergraph with vertex set $[n]$, where each $r$-set is selected as an edge with probability $p$ independently randomly. For $1\leq s \leq r-1$ and two $s$-sets $S$ and $S'$, we say $S$ is connected to $S'$ if there is a sequence of alternating $s$-sets and edges $S_0,F_1,S_1,F_2, \ldots, F_k, S_k$ such that $S_0,S_1,\ldots, S_k$ are $s$-sets, $S_0=S$, $S_k=S'$, $F_1,F_2,\ldots, F_k$ are edges of $H$, and $S_{i-1}\cup S_i\subseteq F_i$ for each $1\leq i\leq k$. This is an equivalence relation over the family of all $s$-sets ${[n]\choose s}$ and results in a partition: ${V\choose s}=\cup_i C_i$. Each $C_i$ is called an { $s$-th-order} connected component and a component $C_i$ is {\em giant} if $|C_i|=Θ(n^s)$. We prove that the sharp threshold of the existence of the $s$-th-order giant connected components in $H^r(n,p)$ is $\frac{1}{\big({r\choose s}-1\big){n\choose r-s}}$. Let $c={n\choose r-s}p$. If $c$ is a constant and $c<\tfrac{1}{\binom{r}{s}-1}$, then with high probability, all $s$-th-order connected components have size $O(\ln n)$. If $c$ is a constant and $c > \tfrac{1}{\binom{r}{s}-1}$, then with high probability, $H^r(n,p)$ has a unique giant connected $s$-th-order component and its size is $(z+o(1)){n\choose s}$, where $$z=1-\sum_{j=0}^\infty \frac{\left({r\choose s}j -j+1 \right)^{j-1}}{j!}c^je^{-c\left({r\choose s}j -j+1\right)}.$$

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

↑