Inductive Graph Layout with Implicit Neural Fields
arXiv:2608. 08876v1 Announce Type: cross Abstract: A graph layout is normally a table of $N$ free coordinates.
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:2608. 08876v1 Announce Type: cross Abstract: A graph layout is normally a table of $N$ free coordinates.
arXiv:2606. 01546v1 Announce Type: new Abstract: Sparse high-dimensional representations are conducive to uncovering nontrivial structures in unsupervised exploration of data.
arXiv:2605. 21510v2 Announce Type: replace-cross Abstract: Reference-based graph compression encodes each vertex's neighbor list as differences from a nearby encoded list.
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.
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.
arXiv:2611.05729v1 Announce Type: new Abstract: With scalable Laplacian solvers now available, the next frontier is to exploit them more effectively for high-quality hypergraph partitioning. In this...
arXiv:2608.29635v1 Announce Type: new Abstract: We study unsupervised hypergraph alignment, where the goal is to infer node correspondences between two hypergraphs using only structural information,...
arXiv:2605. 22346v2 Announce Type: replace-cross Abstract: Two of the most widely used methods for analysing graph data, Adjacency Spectral Embedding and Laplacian Spectral Embedding, often produce different results when applied to the same graph.
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.
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.
arXiv:2609.36074v1 Announce Type: new Abstract: Memory-efficient scaling on clustering problems without sacrificing statistical accuracy is of central interest for large-scale data analysis and machi...
arXiv:2606. 15482v1 Announce Type: cross Abstract: Ricci flow is a curvature-guided diffusion process that deforms space by shrinking regions of high positive curvature and expanding those with negative curvature.