Graphons of Line Graphs 论文更新
Get the story
2026年10月9日,arXiv 统计学机器学习栏目发布关于线图的 Graphon 估计方法的论文。论文提出一种通过将稀疏有限图映射到其线图来估计图极限(graphon)的方法。满足“平方度性质”的稀疏图(如星图)会产生稠密线图,从而可借助稠密图极限理论推导收敛,并能在经验上区分不同数量的星图,而原图因稀疏性都收敛到零 graphon。此外,超线性优先连接图几乎必然产生稠密线图,而 Erdos-Renyi 等稠密图的线图则变稀疏并收敛到零 graphon。
Generated from reports · updated 3 hr ago
Timeline
Follow the coverage from different angles.
- arXiv · Statistics Machine Learning线图的 Graphon 估计方法
论文提出一种通过将稀疏有限图映射到其线图来估计图极限(graphon)的方法。满足“平方度性质”的稀疏图(如星图)会产生稠密线图,从而可借助稠密图极限理论推导收敛,并能在经验上区分不同数量的星图,而原图因稀疏性都收敛到零 graphon;超线性优先连接图几乎必然产生稠密线图,而 Erdos-Renyi 等稠密图的线图则变稀疏并收敛到零 graphon。
Heat trend
Current heat 9·Comparable peak 10(Oct 9)·Comparable change over 24 hours –
The trend compares only the same participants observed continuously; its range may be smaller than the current heat count. Move or click on the chart to inspect hourly heat; use the left and right arrow keys to switch.