Translator Disclaimer
9 September 2019 Time-resolved analysis of dynamic graphs: an extended Slepian design
Author Affiliations +
Graphs are extensively used to represent networked data. In many applications, especially when considering large datasets, it is a desirable feature to focus the analysis onto specific subgraphs of interest. Slepian theory and its extension to graphs allows to do this and has been applied recently to analyze various types of networks. One limitation of this framework, however, is that the number of subgraphs of interest is typically limited to one. We introduce an extended Slepian design that allows to consider an arbitrary number of subgraphs of interest. This extension offers the possibility to encode prior information about multiple subgraphs in a two-dimensional plane. As a proof of concept and potential application, we demonstrate that this framework allows to perform time-resolved and spatio-temporal analyses of dynamic graphs.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Raphaël Liégeois, Ibrahim Merad, and Dimitri Van De Ville "Time-resolved analysis of dynamic graphs: an extended Slepian design", Proc. SPIE 11138, Wavelets and Sparsity XVIII, 1113810 (9 September 2019);


CORDIC Algorithms: Theory And Extensions
Proceedings of SPIE (November 13 1989)
New family of periodic spline functions
Proceedings of SPIE (August 31 1995)
Recursive ULV decomposition
Proceedings of SPIE (November 12 2000)
Schur method for low-rank matrix approximation
Proceedings of SPIE (October 27 1994)

Back to Top