Pith. sign in

REVIEW

Multiplex graph matching matched filters

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1908.02572 v3 pith:R4BZLUMN submitted 2019-07-23 cs.SI math.CO

Konstantinos Pantazis , Daniel L. Sussman , Youngser Park , Zhirui Li , Carey E. Priebe , Vince Lyzinski This is my paper · ORCID
classification cs.SImath.CO
keywords multiplextemplateapproachbackgroundgraphmatchedmatchingnetwork
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools