Evidence map›Paper›PMID 42453689›Full record

ArticlePatterns (New York, N.Y.)2026

Graphlet- and motif-based link prediction in large networks.

Wayne B Hayes, Kimia Yazdani, S M A Nahian, Ezra Alemu

Abstract read
In one paragraph

Article in Patterns (New York, N.Y.), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing 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

1 citing paper in PubMed.

  1. 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

4 authors.

Wayne B HayesComputer Science, University of California, Irvine, Irvine, CA 92697-3435, USA.
Kimia YazdaniComputer Science, University of California, Irvine, Irvine, CA 92697-3435, USA.
S M A NahianDhaka College, New Market, Dhaka 1205, Bangladesh.
Ezra AlemuComputer Science, University of California, Irvine, Irvine, CA 92697-3435, USA.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Link prediction is important across biological, social, and technological networks, but many methods either require domain-specific node attributes, do not scale to large graphs, or miss higher-order topology. We present BLANT-Predict, a topology-only framework that uses sampled graphlets and orbit-pair frequencies to rank likely missing edges. Across 12 real-world networks (up to about 1 million nodes and 3 million edges), we compare against 13 baseline methods and observe higher precision with strong scalability. Beyond standard

Indexed as

edge predictiongraphletslink predictionmotifsnetwork topology

Identifiers

PMID42453689
PMCPMC13366520

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.