Spectral Algorithms for Streaming Graph Analysis: A Survey

Article Type

Research Article

Publication Title

Annals of Data Science


Streaming data models refer to some constrained settings through which continuous flow of information regarding updates on the data becomes available. Graphs can also be represented in a streaming setting where interaction information turns out to be accessible as a stream of inclusion or exclusion of interactions. Analysis of streaming graphs helps to understand extreme-scale and dynamic real-life interactions in different forms. The growth of world wide web has drastically changed the way we look at various real-life evolving gigantic networks. This has motivated the development of streaming algorithms to be applied on graphs at scale. To achieve this scalability, sketching and sampling strategies are generally adopted to realize the different attributes of graphs. Spectrum of a graph, being one of the most appreciated characteristics, has lead to the evolution of an entire class of spectral algorithms. In this paper, we touch upon the state-of-the-art progress in streaming graph analysis with spectral algorithms. We mainly cover the latest developments in the areas like sampling, sparsification, singular value decomposition, counting problems related to local structures, analysis of global structures, partitioning, labeling, mesh processing, discovery of patterns, anomalous hotspot discovery, detection of communities, etc. on the subject of streaming graphs.

First Page


Last Page




Publication Date


This document is currently not available here.