稠密无爪图的典型结构
The typical structure of dense claw-free graphs
AI总结:
本文分析了常数边密度下无爪图的渐近数量与典型结构,通过求解 graphon 上的变分问题给出了对数渐近公式,并揭示了其在特定边密度下的二阶和一阶相变现象及相应的唯一最优 graphon。
摘要:
我们分析了常数边密度下无爪图的渐近数量和典型结构。我们的第一个主要结果是关于边密度为 $γ\in (0,1)$ 的无爪图数量的对数渐近公式。我们证明了该问题在边密度 $γ^\ast=\frac{5-\sqrt{5}}{4}$ 处表现出二阶相变。该渐近公式通过求解 graphon 上的变分问题得出。对于 $γ\geqγ^\ast$,存在唯一的最优 graphon,而对于 $γ<γ^\ast$,存在无限个最优 graphon。通过分析更详细的结构,我们证明对于 $γ<γ^\ast$,实际上存在唯一的 graphon $W$,使得几乎所有边密度为 $γ$ 的无爪图在割度量下都接近于 $W$。我们还分析了常数 $p$ 下 Erdős-Rényi 随机图 $G(n,p)$ 中无爪性的概率,得到了无爪性的大偏差速率函数公式。在这种情况下,问题在 $p^\ast=\frac{3-\sqrt{5}}{2}$ 处表现出分离不同结构区域的一阶相变。在临界点 $p^\ast$ 处,相应的 graphon 变分问题有无限多个解,我们再次精确定位了唯一的描述以无爪为条件的 $G(n,p^\ast)$ 典型结构的最优 graphon。
英文摘要:
We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarithm of the number of claw-free graphs of edge density $γ\in (0,1)$. We show that the problem exhibits a second-order phase transition at edge density $γ^\ast=\frac{5-\sqrt{5}}{4}$. The asymptotic formula arises by solving a variational problem over graphons. For $γ\geqγ^\ast$ there is a unique optimal graphon, while for $γ<γ^\ast$ there is an infinite set of optimal graphons. By analyzing more detailed structure, we prove that for $γ<γ^\ast$, there is in fact a unique graphon $W$ such that almost all claw-free graphs at edge density $γ$ are close in cut metric to $W$. We also analyze the probability of claw-freeness in the Erdős-Rényi random graph $G(n,p)$ for constant $p$, obtaining a formula for the large-deviation rate function for claw-freeness. In this case, the problem exhibits a first-order phase transition at $p^\ast=\frac{3-\sqrt{5}}{2}$, separating distinct structural regimes. At the critical point $p^\ast$, the corresponding graphon variational problem has infinitely many solutions, and we again pinpoint a unique optimal graphon that describes the typical structure of $G(n,p^\ast)$ conditioned on being claw-free.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。