线图的图极限
Graphons of Line Graphs
AI总结:
本文提出通过将稀疏图映射为线图来估计图极限,证明满足平方度性质的稀疏图(如星图)会产生稠密线图和非零 graphon,从而克服原始稀疏图收敛到零 graphon 的问题。
摘要:
我们考虑从稀疏有限图序列的观测中估计图极限(称为 graphon)的问题。在本文中,我们展示了一种简单的方法,可以揭示稀疏图的一个子集。该方法涉及将原始图映射到它们的线图。我们证明,满足特定性质(我们称之为平方度性质)的图是稀疏的,但会产生稠密的线图。这使得能够利用稠密图的图极限结果来推导收敛性。特别地,星图满足平方度性质,从而产生稠密的线图和非零的线图 graphon。我们通过实验证明,我们可以通过相应线图的 graphon 来区分不同数量的星图(它们是稀疏的)。而在原始图中,由于稀疏性,不同数量的星图都收敛到零 graphon。类似地,超线性优先连接图几乎必然产生稠密的线图。相比之下,稠密图,包括 Erdős-Rényi 图,使得线图变得稀疏,从而产生零 graphon。
英文摘要:
We consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves mapping the original graphs to their line graphs. We show that graphs satisfying a particular property, which we call the square-degree property are sparse, but give rise to dense line graphs. This enables the use of results on graph limits of dense graphs to derive convergence. In particular, star graphs satisfy the square-degree property resulting in dense line graphs and non-zero graphons of line graphs. We demonstrate empirically that we can distinguish different numbers of stars (which are sparse) by the graphons of their corresponding line graphs. Whereas in the original graphs, the different number of stars all converge to the zero graphon due to sparsity. Similarly, superlinear preferential attachment graphs give rise to dense line graphs almost surely. In contrast, dense graphs, including Erdos-Renyi graphs make the line graphs sparse, resulting in the zero graphon.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。