Multilayer spectral graph clustering via convex layer aggregation
- Univ. of Michigan, Ann Arbor, MI (United States). Dept. of Electrical Engineering and Computer Science
Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. New challenges arise in multilayer graph clustering for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a theoretical framework for multilayer spectral graph clustering of the nodes via convex layer aggregation. Under a novel multilayer signal plus noise model, we provide a phase transition analysis that establishes the existence of a critical value on the noise level that permits reliable cluster separation. The analysis also specifies analytical upper and lower bounds on the critical value, where the bounds become exact when the clusters have identical sizes. Numerical experiments on synthetic multilayer graphs are conducted to validate the phase transition analysis and study the effect of layer weights and noise levels on clustering reliability.
- Research Organization:
- Univ. of Michigan, Ann Arbor, MI (United States)
- Sponsoring Organization:
- USDOE NA Office of Nonproliferation and Verification Research and Development (NA-22)
- DOE Contract Number:
- NA0002534
- OSTI ID:
- 1454763
- Resource Relation:
- Conference: 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP), Washington, DC (United States), 7-9 Dec 2016
- Country of Publication:
- United States
- Language:
- English
Similar Records
Phase Transitions and a Model Order Selection Criterion for Spectral Graph Clustering
A framework for graph-based synthesis, analysis, and visualization of HPC cluster job data.