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

奇异图子的一个中心极限定理

A central limit theorem for singular graphons

Pierre-Loïc Méliot

摘要:

我们将$W$ -随机图序列$(G_n(γ))_{n \geq 1}$与图子$γ$联系起来.我们说图子是奇异的,如果对任何有限图$F$,同态密度$t(F,G_n(γ))$有一个方差的顺序$O(n^{-2})$。这种行为是奇异的,因为一般来说,在$W$ -随机图中,固定有限图$F$的密度具有阶数$O(n^{-1})$的方差。我们猜想唯一的奇异图子是具有$p \in [0,1]$的常数图子$γ_p$,对应于Erdens-Rényi随机图$G(n,p)$ .本文研究了奇异图子的一般性质,证明了奇异图子与Erdens-Rényi随机图有许多共同的性质.特别地,如果$γ$是奇异图子,则缩放密度$n(t(F,G_n(γ))-\mathbb{E}[t(F,G_n(γ))])$在联合分布中收敛。这推广了Erdens-Rényi随机图$G(n,p)$所满足的中心极限定理;然而,如果猜想不成立,极限分布可能是非高斯的。我们还建立了一个方程所满足的特征多项式的拉普拉斯算子的图$G_n(γ)$相关的奇异graphon,这开辟了道路的频谱方法的猜想。

英文摘要:

We associate to a graphon $γ$ the sequence of $W$-random graphs $(G_n(γ))_{n \geq 1}$. We say that the graphon is singular if, for any finite graph $F$, the homomorphism density $t(F,G_n(γ))$ has a variance of order $O(n^{-2})$. This behavior is singular because generically, the density of a fixed finite graph $F$ in a $W$-random graph has a variance of order $O(n^{-1})$. We conjecture that the only singular graphons are the constant graphons $γ_p$ with $p \in [0,1]$, corresponding to the Erdős-Rényi random graphs $G(n,p)$. In this paper, we investigate the general properties of the singular graphons, and we show that they share many properties with the Erdős-Rényi random graphs. In particular, if $γ$ is a singular graphon, then the scaled densities $n(t(F,G_n(γ))-\mathbb{E}[t(F,G_n(γ))])$ converge in joint distribution. This generalises the central limit theorem satisfied by the Erdős-Rényi random graphs $G(n,p)$; however, the limiting distribution might be non-Gaussian if the conjecture does not hold. We also establish an equation satisfied by the characteristic polynomial of the Laplacian of the graph $G_n(γ)$ associated to a singular graphon; this opens the way to a spectral approach of the conjecture.

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

↑