跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+92新增 AI 导读

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-22 06:04 — 2026-11-23 06:04(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-23 01:05(北京时间)
版本更新 · v2arXiv:2605.29290

A Two-Count Baseline for Change Detection on Dynamic Networks

Izhar Ali

原文摘要

Change-point detectors for dynamic networks aim to find changes in how a network is connected. They are evaluated on real networks with labelled events, but many of these events also change how active the network is: how many vertices take part and how many edges are present. A detector can therefore score well by responding to activity alone, without detecting any change in structure. We test whether detectors from the literature beat a simple baseline that tracks only the number of active vertices and the number of edges in each snapshot, a baseline that we motivate with a standard statistical test for a change in activity. On ten datasets, four of them from the papers of published detectors, none of thirteen detectors ranks the labelled events significantly better than the baseline when the results are pooled (AUC $0.75$, or $0.73$ with scales taken from early snapshots only, against $0.66$ for the best detector). The baseline is best on only two datasets, however, and on the four datasets with the most events three detectors that track individual vertices score higher. When we rewire networks while keeping the degree of every vertex fixed, most detectors that ignore vertex identities barely respond, but several that track individual vertices do. New detectors should be compared with this baseline and tested at fixed degree.

cs.CG