English

The Ubiquitous Sparse Matrix-Matrix Products

Numerical Analysis 2025-08-07 v1 Distributed, Parallel, and Cluster Computing Machine Learning Mathematical Software Numerical Analysis Combinatorics

Abstract

Multiplication of a sparse matrix with another (dense or sparse) matrix is a fundamental operation that captures the computational patterns of many data science applications, including but not limited to graph algorithms, sparsely connected neural networks, graph neural networks, clustering, and many-to-many comparisons of biological sequencing data. In many application scenarios, the matrix multiplication takes places on an arbitrary algebraic semiring where the scalar operations are overloaded with user-defined functions with certain properties or a more general heterogenous algebra where even the domains of the input matrices can be different. Here, we provide a unifying treatment of the sparse matrix-matrix operation and its rich application space including machine learning, computational biology and chemistry, graph algorithms, and scientific computing.

Keywords

Cite

@article{arxiv.2508.04077,
  title  = {The Ubiquitous Sparse Matrix-Matrix Products},
  author = {Aydın Buluç},
  journal= {arXiv preprint arXiv:2508.04077},
  year   = {2025}
}
R2 v1 2026-07-01T04:36:33.205Z