2 citations · 6 across the 13 of their papers we have counts for
14 papers
LLMs for Social Network Modeling: From Network Generation to Dynamic Processes
Shikha Mallick, Alex Thomo, Akrati Saxena
Large language models (LLMs) are rapidly emerging as a new paradigm for modeling social networks by representing users and their relationships and interactions through natural lang…
The Reasoning Bottleneck in Graph-RAG: Structured Prompting and Context Compression for Multi-Hop QA
Yasaman Zarrinkia, Venkatesh Srinivasan, Alex Thomo
Graph-RAG systems achieve strong multi-hop question answering by indexing documents into knowledge graphs, but strong retrieval does not guarantee strong answers. Evaluating KET-RA…
Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time
Valerie King, Alex Thomo, Quinton Yong
The problem of finding the degeneracy of a graph is a subproblem of the k-core decomposition problem. In this paper, we present a (1 + epsilon)-approximate solution to the degenera…
Multi-Stage Graph Peeling Algorithm for Probabilistic Core Decomposition
Yang Guo, Xuekui Zhang, Fatemeh Esfahani +3
Mining dense subgraphs where vertices connect closely with each other is a common task when analyzing graphs. A very popular notion in subgraph analysis is core decomposition. Rece…
Utility-Based Graph Summarization: New and Improved
Mahdi Hajiabadi, Jasbir Singh, Venkatesh Srinivasan +1
A fundamental challenge in graph mining is the ever-increasing size of datasets. Graph summarization aims to find a compact representation resulting in faster algorithms and reduce…
Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms
Fatemeh Esfahani, Venkatesh Srinivasan, Alex Thomo +1
Finding dense components in graphs is of great importance in analyzing the structure of networks. Popular and computationally feasible frameworks for discovering dense subgraphs ar…