Multiplex graph matching matched filters
From MaRDI portal
Abstract: 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.
This page was built for publication: Multiplex graph matching matched filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323309)
