1 citations · 1 across the 8 of their papers we have counts for
9 papers
Exact Topological Compliance: Generating Persistence-Equivalent Graphs
Mattie Ji, Indradyumna Roy, Vikas Garg
Persistent homology summarizes the topological evolution of a graph as persistence diagrams (PDs). Generating graphs whose topology matches a target descriptor is increasingly impo…
Contraction and Hourglass Persistence for Learning on Graphs, Simplices, and Cells
Mattie Ji, Indradyumna Roy, Vikas Garg
Persistent homology (PH) encodes global information, such as cycles, and is thus increasingly integrated into graph neural networks (GNNs). PH methods in GNNs typically traverse an…
Contextual Tokenization for Graph Inverted Indices
Pritish Chakraborty, Indradyumna Roy, Soumen Chakrabarti +1
Retrieving graphs from a large corpus, that contain a subgraph isomorphic to a given query graph, is a core operation in many real-world applications. While recent multi-vector gra…
Charting the Design Space of Neural Graph Representations for Subgraph Matching
Vaibhav Raj, Indradyumna Roy, Ashwin Ramachandran +2
Subgraph matching is vital in knowledge graph (KG) question answering, molecule design, scene graph, code and circuit search, etc. Neural methods have shown promising results for s…
Iteratively Refined Early Interaction Alignment for Subgraph Matching based Graph Retrieval
Ashwin Ramachandran, Vaibhav Raj, Indrayumna Roy +2
Graph retrieval based on subgraph isomorphism has several real-world applications such as scene graph retrieval, molecular fingerprint detection and circuit design. Roy et al. [35]…
Graph Edit Distance with General Costs Using Neural Set Divergence
Eeshaan Jain, Indradyumna Roy, Saswat Meher +2
Graph Edit Distance (GED) measures the (dis-)similarity between two given graphs, in terms of the minimum-cost edit sequence that transforms one graph to the other. However, the ex…
Maximum Common Subgraph Guided Graph Retrieval: Late and Early Interaction Networks
Indradyumna Roy, Soumen Chakrabarti, Abir De
The graph retrieval problem is to search in a large corpus of graphs for ones that are most similar to a query graph. A common consideration for scoring similarity is the maximum c…
Adversarial Permutation Guided Node Representations for Link Prediction
Indradyumna Roy, Abir De, Soumen Chakrabarti
After observing a snapshot of a social network, a link prediction (LP) algorithm identifies node pairs between which new edges will likely materialize in future. Most LP algorithms…
Plagiarism Detection in Polyphonic Music using Monaural Signal Separation
Soham De, Indradyumna Roy, Tarunima Prabhakar +4
Given the large number of new musical tracks released each year, automated approaches to plagiarism detection are essential to help us track potential violations of copyright. Most…