Localizing Anomalous Changes in Time-evolving Graphs
Summary: CAD: a fast commute-time based method to localize anomalous edge changes in time-evolving, undirected weighted graphs. It combines commute-time distance shifts with weight changes to output anomalous edges/nodes in O(n log n) per instance; validated on Enron, DBLP, and precipitation networks. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kumar Sricharan
- 2. Kamalika Das
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,394 | Efficient Estimation of Pairwise Effective Resistance | 2023 | SIGMOD | 4.7427524e-05 |
| 9,057 | Behavior Query Discovery in System-Generated Temporal Graphs | 2016 | VLDB | 4.4039656e-05 |
| 10,865 | Approximate Anchored Densest Subgraph Search on Large Static and Dynamic Graphs | 2025 | VLDB | 4.1945683e-05 |
| 10,957 | Efficient and Provable Effective Resistance Computation on Large Graphs: an Index-based Approach | 2024 | SIGMOD | 4.1945683e-05 |
| 10,958 | Efficient Approximation of Kemeny’s Constant for Large Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 10,991 | Online Detection of Anomalies in Temporal Knowledge Graphs with Interpretability | 2024 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next