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

关于随机图的下尾变分问题

On the lower tail variational problem for random graphs

Yufei Zhao

摘要:

研究了随机图中子图计数的下尾大偏差问题。设$X_H$表示Erdens-Rényi随机图$\mathcal{G}(n,p)$中$H$的拷贝数。我们有兴趣估计固定$0 < δ< 1$的下尾概率$\mathbb{P}(X_H \le (1-δ) \mathbb{E} X_H)$。多亏了查特吉、登博和瓦拉德汉的结果,这个大偏差问题已经被简化为一个关于图子的自然变分问题,至少对于$p \ge n^{-α_H}$是这样的(对于更大范围的$p$也是这样)。我们研究这个变分问题,并提供了一个部分的所谓的“副本对称”相的表征。非正式地,我们的主要结果表明,对于每个$H$,以及对于某些$δ_H > 0$的$0 < δ< δ_H$,随着$p \to 0$缓慢,对较低尾概率的主要贡献来自具有均匀倾斜边密度的埃尔德什-雷尼随机图。另一方面,对于非二分的$H$和接近1的$δ$,这是假的。

英文摘要:

We study the lower tail large deviation problem for subgraph counts in a random graph. Let $X_H$ denote the number of copies of $H$ in an Erdős-Rényi random graph $\mathcal{G}(n,p)$. We are interested in estimating the lower tail probability $\mathbb{P}(X_H \le (1-δ) \mathbb{E} X_H)$ for fixed $0 < δ< 1$. Thanks to the results of Chatterjee, Dembo, and Varadhan, this large deviation problem has been reduced to a natural variational problem over graphons, at least for $p \ge n^{-α_H}$ (and conjecturally for a larger range of $p$). We study this variational problem and provide a partial characterization of the so-called "replica symmetric" phase. Informally, our main result says that for every $H$, and $0 < δ< δ_H$ for some $δ_H > 0$, as $p \to 0$ slowly, the main contribution to the lower tail probability comes from Erdős-Rényi random graphs with a uniformly tilted edge density. On the other hand, this is false for non-bipartite $H$ and $δ$ close to 1.

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

↑