activity
20122026
most citedLocal Algorithms for Hierarchical Dense Subgraph Discovery

55 citations · 159 across the 17 of their papers we have counts for

collaborators

17 papers

cs.LG2026

Stochastic Event Prediction via Temporal Motif Transitions

İbrahim Bahadır Altun, Ahmet Erdem Sarıyüce

Networks of timestamped interactions arise across social, financial, and biological domains, where forecasting future events requires modeling both evolving topology and temporal o…

cs.DM2023

Retrieving Top-k Hyperedge Triplets: Models and Applications

Jason Niu, Ilya D. Amburg, Sinan G. Aksoy +1

Complex systems frequently exhibit multi-way, rather than pairwise, interactions. These group interactions cannot be faithfully modeled as collections of pairwise interactions usin…

cs.SI2023★ 1 cited

Quantifying Node-based Core Resilience

Jakir Hossain, Sucheta Soundarajan, Ahmet Erdem Sarıyüce

Core decomposition is an efficient building block for various graph analysis tasks such as dense subgraph discovery and identifying influential nodes. One crucial weakness of the c…

cs.SI2023★ 11 cited

Using Motif Transitions for Temporal Graph Generation

Penghang Liu, A. Erdem Sarıyüce

Graph generative models are highly important for sharing surrogate data and benchmarking purposes. Real-world complex systems often exhibit dynamic nature, where the interactions a…

cs.SI2023★ 1 cited

Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms

Penghang Liu, Bahadir Altun, Rupam Acharyya +4

Understanding the dynamics of financial transactions among people is critical for various applications such as fraud detection. One important aspect of financial transaction networ…

cs.SI2021★ 18 cited

Temporal Motifs in Patent Opposition and Collaboration Networks

Penghang Liu, Naoki Masuda, Tomomi Kito +1

Patents are intellectual properties that reflect innovative activities of companies and organizations. The literature is rich with the studies that analyze the citations among the…