Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression

TL;DR

This paper introduces an algebraic vertex ordering method that improves adjacency access locality and graph compression efficiency, with applications to matrix-vector multiplication and network analysis.

Contribution

It proposes a novel algebraic indexing approach that enhances existing vertex ordering techniques for better graph compression and computational performance.

Findings

Superior graph compression across diverse graph types

Improved matrix-vector multiplication efficiency

Enhanced performance in network random walk queries

Abstract

In this work, we establish theoretical and practical connections between vertex indexing for sparse graph/network compression and matrix ordering for sparse matrix-vector multiplication and variable elimination. We present a fundamental analysis of adjacency access locality in vertex ordering from the perspective of graph composition of, or decomposition into, elementary compact graphs. We introduce an algebraic indexing approach that maintains the advantageous features of existing methods, mitigates their shortcomings, and adapts to the degree distribution. The new method demonstrates superior and versatile performance in graph compression across diverse types of graphs. It also renders proportional improvement in the efficiency of matrix-vector multiplications for subspace iterations in response to random walk queries on a large network.