Evidence map›Paper›PMID 33343893›Full record

ArticleInformation and inference : a journal of the IMA2020

Matchability of heterogeneous networks pairs.

Vince Lyzinski, Daniel L Sussman

Abstract read
In one paragraph

Article in Information and inference : a journal of the IMA, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Matched Filters for Noisy Induced Subgraph Detection.IEEE transactions on pattern analysis and machine intelligence · 2020
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Vince LyzinskiDepartment of Mathematics, University of Maryland, College Park, MD, USA 20742.
Daniel L SussmanDepartment of Mathematics and Statistics, Boston University, Boston, MA, USA 02215.

Funding

A 5-dimensional connectomics approach to the neural basis of behaviorU01NS108637 · NINDS · UNIVERSITY OF MASSACHUSETTS AMHERST · PI KATZ, PAUL S · 2018 to 2020
$3.4M
NINDS NIH HHS U01 NS108637
6 · The paper itself

Abstract

We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability can be lost with high probability when matching the networks directly. We further demonstrate that under mild model assumptions, matchability is almost perfectly recovered by centering the networks using universal singular value thresholding before matching. These theoretical results are then demonstrated in both real and synthetic simulation settings. We also recover analogous core-matchability results in a very general core-junk network model, wherein some vertices do not correspond between the graph pair.

Indexed as

graph matchingrandom graphssingular value thresholding

Identifiers

PMID33343893
PMCPMC7737166

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.