Hot eventLive
无顶点对应随机图双样本检验样本复杂度研究
1 reports1 sources3 hr ago updated
Get the story
AI overview
2026年10月7日,arXiv Statistics Machine Learning 发布一手研究,探讨无顶点对应情形下随机图的两样本检验问题。研究给出样本复杂度结果:在 Erdős–Rényi 零假设与保持期望度不变的双块差异设定下,每组需 m≍t⁻³ 个图(t<1),带符号三角形计数可达该速率。报道同时提及顶点对齐时 m≍t⁻³ 即可,错位代价约 t⁻²;该表述与前述无顶点对应情形的速率相同,报道未进一步说明两者差异或适用条件,需注意区分。
Generated from reports · updated 3 hr ago
Timeline
Follow the coverage from different angles.
Oct 7, 2026
- arXiv · Statistics Machine Learning无顶点对应的随机图两样本检验
研究给出无顶点对应情形下随机图两样本检验的样本复杂度:在 Erdős–Rényi 零假设与保持期望度不变的双块差异下,每组需 m≍t⁻³ 个图(t<1),带符号三角形计数可达该速率;顶点对齐时 m≍t⁻³ 即可,错位代价约 t⁻²。
Heat trend
Current heat 9·Comparable peak 10(Oct 7)·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.