We consider the problem of detecting a noisy induced multiplex template network in a larger multiplex background network. Our approach, which extends the framework of Sussman et al. (2019) to the multiplex setting, leverages 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.
@article{arxiv.1908.02572,
title = {Multiplex graph matching matched filters},
author = {Konstantinos Pantazis and Daniel L. Sussman and Youngser Park and Zhirui Li and Carey E. Priebe and Vince Lyzinski},
journal= {arXiv preprint arXiv:1908.02572},
year = {2021}
}