학술논문

Multiplex graph matching matched filters
Document Type
Original Paper
Source
Applied Network Science. 7(1)
Subject
Multiplex graphs
Graph matching
Correlation network models
Matched filters
Language
English
ISSN
2364-8228
Abstract
We consider the problem of detecting a noisy induced multiplex template network in a larger multiplex background network. Our approach, which extends the graph matching matched filter framework of Sussman et al. (IEEE Trans Pattern Anal Mach Intell 42(11):2887–2900, 2019) to the multiplex setting, utilizes a multiplex analogue of the classical graph matching problem to use the template as a matched filter for efficiently searching the background for candidate template matches. The effectiveness of our approach is demonstrated both theoretically and empirically, with particular attention paid to the potential benefits of considering multiple channels in the multiplex framework.