DeepAI AI Chat
Log In Sign Up

Streaming and Batch Algorithms for Truss Decomposition

by   Venkata Rohit Jakkula, et al.
University of Minnesota

Truss decomposition is a method used to analyze large sparse graphs in order to identify successively better connected subgraphs. Since in many domains the underlying graph changes over time, its associated truss decomposition needs to be updated as well. This work focuses on the problem of incrementally updating an existing truss decomposition and makes the following three significant contributions. First, it presents a theory that identifies how the truss decomposition can change as new edges get added. Second, it develops an efficient incremental algorithm that incorporates various optimizations to update the truss decomposition after every edge addition. These optimizations are designed to reduce the number of edges that are explored by the algorithm. Third, it extends this algorithm to batch updates (i.e., where the truss decomposition needs to be updated after a set of edges are added), which reduces the overall computations that need to be performed. We evaluated the performance of our algorithms on real-world datasets. Our incremental algorithm achieves over 250000x average speedup for inserting an edge in a graph with 10 million edges relative to the non-incremental algorithm. Further, our experiments on batch updates show that our batch algorithm consistently performs better than the incremental algorithm.


page 1

page 2

page 3

page 4


SamBaTen: Sampling-based Batch Incremental Tensor Decomposition

Tensor decompositions are invaluable tools in analyzing multimodal datas...

Layph: Making Change Propagation Constraint in Incremental Graph Processing by Layering Graph

Real-world graphs are constantly evolving, which demands updates of the ...

Dynamical SimRank Search on Time-Varying Networks

In this article, we study the efficient dynamical computation of all-pai...

Incremental Dead State Detection in Logarithmic Time

Identifying live and dead states in an abstract transition system is a r...

Online Edge Grafting for Efficient MRF Structure Learning

Incremental methods for structure learning of pairwise Markov random fie...

Hyperplane arrangements in polymake

Hyperplane arrangements form the latest addition to the zoo of combinato...