TigerGraph Logo Docs

            

          
Page 1PrevNext
Search by Algolia
Products
TigerGraph Savanna
TigerGraph Savanna (TigerGraph Cloud Classic)
TigerGraph Server
TigerGraph DB
TigerGraph Suite
GraphStudio and Admin Portal Insights GSQL Web Shell
Query Languages
GSQL Language Reference GSQL Web Shell OpenCypher
AI & Graph Intelligence
Graph Data Science Library Hybrid Graph+Vector Search
Connectors and APIs
Data Connectors pyTigerGraph TigerGraph GraphQL Service JDBC Driver
Resources
Developer Site Community Forum Knowledge Base
Download
TG Savanna

Graph Data Science Library

    • Overview
      • Library Structure
      • Table: Algorithm Availability and Dependencies
    • Using an Algorithm
      • Packaged Template Algorithms
      • Algorithms as GSQL Queries
    • Centrality Algorithms
      • Approximate Closeness Centrality
      • ArticleRank
      • Betweenness Centrality
      • Closeness Centrality
      • Degree Centrality
      • Eigenvector Centrality
      • Harmonic Centrality
      • Influence Maximization
      • PageRank
      • Personalized PageRank
      • Weighted Degree Centrality
      • Weighted PageRank
    • Classification Algorithms
      • Greedy Graph Coloring
      • k-Nearest Neighbors
      • k-Nearest Neighbors (Batch Version)
      • k-Nearest Neighbors (Cross-Validation Version)
      • Maximal Independent Set
      • Weisfeiler-Lehman Isomorphism
    • Community Algorithms
      • Weakly Connected Components
        • WCC (Small-World Optimized)
      • k-Core Decomposition
      • k-Means Clustering
      • Label Propagation
      • Speaker-Listener Label Propagation
      • Local Clustering Coefficient
      • Louvain
      • Strongly Connected Components
        • SCC (Small-World Optimized)
      • Triangle Counting
    • Node Embedding Algorithms
      • Fast Random Projection
      • NodePiece Models
    • Pathfinding Algorithms
      • A*
      • All-Pairs Shortest Path
      • All Paths (Single-Pair)
      • Breadth-First Search
      • Cycle Detection
      • Cycle Component
      • Estimated Diameter
      • Maximum Flow
      • Minimum Spanning Forest
      • Minimum Spanning Tree
      • Single-source Shortest Path (Unweighted)
      • Single-source Shortest Path (Weighted)
    • Similarity Algorithms
      • Cosine Similarity of Neighborhoods (All Pairs, Batch)
      • Cosine Similarity of Neighborhoods (Single-Source)
      • Jaccard Similarity of Neighborhoods (All Pairs, Batch)
      • Jaccard Similarity of Neighborhoods (Single Source)
      • Vector Functions
    • Topological Link Prediction Algorithms
      • Adamic Adar
      • Common Neighbors
      • Preferential Attachment
      • Resource Allocation
      • Same Community
      • Total Neighbors
    • Legacy Version Documentation
Graph Data Science Library 3.10
    Fully-Managed: Savanna

    Self-Managed: TigerGraph DB
    Install Manage


    Tutorials & Guides
    GSQL OpenCypher in GSQL Hybrid Vector Search

    Reference Manuals
    GSQL OpenCypher Vector REST APIs Configuration Parameters

    Visual Tools
    Develop: GraphStudio Administer: Admin Portal Visualize: Insights

    AI & Data Science
    Graph Algorithms pyTigerGraph TigerGraphX ML Workbench

  • TigerGraph DB
    • 4.2 Pre
    • 4.1
    • 3.11
    • 3.10
    • 3.9
    • 3.6
  • GSQL Language Reference
    • 4.2 Pre
    • 4.1
    • 3.11
    • 3.10
    • 3.9
    • 3.6
  • TigerGraph Savanna
  • GraphStudio and Admin Portal
    • 4.2 Pre
    • 4.1
    • 3.11
    • 3.10
    • 3.9
    • 3.6
  • Insights
    • 4.2 Pre
    • 4.1
    • 3.11
    • 3.10
    • 3.9
  • Graph Data Science Library
    • 3.10
  • pyTigerGraph
    • 1.8
    • 1.7
    • 1.6
  • TigerGraph ML Workbench
    • 1.4
  • TigerGraph GraphQL Service
    • 3.9
  • TigerGraph Cloud Classic
  • Graph Data Science Library 3.10
  • Topological Link Prediction Algorithms
Edit this Page

Topological Link Prediction Algorithms

Topological link prediction algorithms determine the closeness score of a pair of vertices. This score can then be used to make predictions about the relationships between the two vertices in the pair.

The TigerGraph Graph Data Science Library provides the following link prediction algorithms:

  • Adamic Adar

  • Common Neighbors

  • Preferential Attachment

  • Resource Allocation

  • Same Community

  • Total Neighbors

3 Twin Dolphin Drive, Ste 225
Redwood City, CA 94065

Copyright © 2025 TigerGraph

  • Resources

    • Support
    • Community
    • Developer Site
    • Test Drive
  • Social

    • Linkedin
    • Facebook
    • Twitter
  • Legal

    • Privacy Policy
    • Terms of Use
    • Sitemap