Abstract: This paper proposes a compression framework for adjacency matrices of weighted graphs based on graph filter banks. Adjacency matrices are widely used mathematical representations of graphs ...

The transitive closue of a directed, acyclic graph can be casually defined as the "reachability matrix" of any given graph. That is, a matrix in which the intersection of any two vertices is either 0, ...

Welcome to my 281 archive! This notes include implementations of basic data structures: union-find sets, unordered_map by hash table, AVL tree, graph represented by adjacency matrix&list and a lot ...

Abstract: Predicting the electricity consumption of individual appliances, known as appliance-level energy consumption (ALEC) prediction, is essential for effective energy management and conservation.

We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs (G n ) n≥0 converging locally to a Galton—Watson tree T (GWT), we provide an explicit formula ...