arXiv Machine Learning

MHeatmap: Two-Walk Laplacian Reordering and Mosaic Layout for Rectangular Matrix Visualization

MHeatmap (Mosaic Heatmap) is a visualization technique for weighted rectangular matrices that improves readability by reordering rows and columns using a Two-Walk spectral seriation approach and by scaling cell dimensions proportionally to row and column totals in a Mosaic layout. The Two-Walk method extends traditional bipartite ordering by incorporating length‑two walks, creating similarity links between rows sharing columns and columns sharing rows, and then sorting a Fiedler vector of the resulting graph Laplacian to obtain coordinated orders. The Mosaic layout partitions a unit square so that cell height and width reflect row and column totals, while color encodes the matrix entries, and the authors provide theoretical proofs and efficient sparse computation for the method, demonstrating superior performance on synthetic and real datasets.

arXiv Machine Learning
Jun 2

Chaining 2-FWL GNNs for Combinatorial Graph Alignment

arXiv:2510. 03086v2 Announce Type: replace Abstract: For the combinatorial graph alignment problem (GAP) -- finding the node correspondence that maximizes the number of common edges (nce) between two unlabeled graphs -- properly initialized FAQ remains a strong classical baseline, while existing GNN approaches struggle in the purely structural setting.

By Marc Lelarge
arXiv Machine Learning
Jun 11

GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs

arXiv:2606. 11562v1 Announce Type: new Abstract: Graph analysis underlies many applications whose answers cannot be looked up in a single record or retrieved along a path: laundering rings, drug repurposing, user preference, and scientific theme are all inferred from a node together with its neighbourhood.

By Zhuoyi Peng, Jingzhou Jiang, Hanlin Gu, Lixin Fan, Yi Yang
arXiv Machine Learning
1d ago

FRESHPart: Feedback-Reshaped Spectral Embedding for Hypergraph Partitioning

The paper introduces FRESHPart, a new spectral hypergraph partitioning framework that refines spectral embeddings using Geometry Feedback and Search Feedback. By analyzing circuit and synthetic hypergraphs, the authors uncover a ray-like embedding structure that explains why projection-based partitioning works well, and show that Laplacian design and hyperedge reweighting can shape this geometry. On the Titan23 benchmark, FRESHPart reduces cut sizes by 13.09% at ε=2% and 25.21% at ε=20% compared to hMETIS, achieving the best reported results while completing all tests in under 120 seconds on a single GPU.

By Rongjian Liang, Zhuo Feng, Brucek Khailany
arXiv AI
Sep 23

Graph Memory for LLM Agents: At What Cost? A Comparative Evaluation of Query, Ingest, and Update Performance Across Graph Database Engines

The paper evaluates seven graph database engines, including Corvic AI, on a synthetic biomedical property graph with 1.02 million nodes and 5.34 million rows. It benchmarks query latency, bulk‑ingest throughput, point‑update latency, and correctness across a twenty‑query workload that covers neighborhood lookups, bounded paths, set intersections, anti‑joins, aggregation, ranking, temporal filters, full scans, and relational joins. The study finds that no single engine is universally fastest; performance depends on query shape, and the largest cost difference arises from bulk‑ingest throughput, which varies by three orders of magnitude and dominates total cost for workloads with fewer than about 10⁵ queries per data refresh.

By Donald Nguyen, Gurbinder Gill, Hadi Ahmadi, Christopher J. Rossbach