TigerGraph
ResourcesPathfinderDiscord(opens in a new tab)
ResourcesPathfinderDiscord(opens in a new tab)
Resources

Everything, In One Wall

Videos, courses, hands-on tutorials, docs, and blog posts. One place for every phase of learning.

TigerGraph
ResourcesPathfinderDiscord(opens in a new tab)

© 2026 Tiger Graph Dev Hub. All rights reserved.

  • Privacy Policy|
  • Terms of Service

Applied · 3

Clear all
  • Reference
  • Concept
  • #Network analysis

Levels

  • All Resources
  • Beginner
  • Intermediate
  • Advanced

Categories

  • Videos514
  • Docs644
  • Glossary50
  • Blog posts222

Assets

  • Definition36
  • Tutorial113
  • How-to guide319
  • Reference312

Tags

  • #Fraud and AML
  • #Entity resolution
  • #Recommendations
  • #GraphRAG and AI
  • #Graph machine learning
  • #Search
  • #Network analysis
  • #Performance and scale
  • #Running TigerGraph

27 resources · page 1 of 3

NewestOldest
3 Col Grid2 Col GridList
Concept
BeginnerConceptSep 12, 2025

Graph-Based Risk Scoring

Code & samples
126
  • Graph Resources52
  • Concept
    109
  • Troubleshooting12
  • Security advisory4
  • Runbook
  • Article173
  • Case study26
  • Talk298
  • Release note24
  • Demo114
  • Webinar12
  • Event12
  • Report24
  • #Evaluating graph

    Graph-based risk scoring is a way of evaluating risk that goes beyond looking at isolated data points. Instead of asking “What did this one account do?” it asks “Who is this account connected to, and how are those connections behaving?” In a graph, entities like people, accounts, devices, or transactions

    Discover
    Reference
    BeginnerReferencev3.10

    Triangle Counting

    Supported Graph Characteristics Unweighted edges Undirected edges Homogeneous vertex types Algorithm link: Triangle Counting Why triangles? Think of it in terms of a soci

    Discover
    Reference
    IntermediateReferencev3.10

    SCC (Small-World Optimized)

    Supported Graph Characteristics Unweighted edges Homogeneous vertex types Heterogeneous vertex types Algorithm link: Strongly Connected Components In addition t

    Discover
    Reference
    IntermediateReferencev3.10

    Closeness Centrality

    Supported Graph Characteristics Unweighted edges Directed edges Undirected edges Homogeneous vertex types Heterogeneous vertex types Algorithm link: Closeness C

    Discover
    Reference
    IntermediateReferencev3.10

    Betweenness Centrality

    Supported Graph Characteristics Unweighted edges Directed edges Undirected edges Homogeneous vertex types Heterogeneous vertex types Algorithm link: Betweenne

    Discover
    Reference
    IntermediateReferencev3.10

    Eigenvector Centrality

    Supported Graph Characteristics Unweighted edges Directed edges Undirected edges Homogeneous vertex types Heterogeneous vertex types Algorithm link: Eigenvect

    Discover
    Reference
    IntermediateReferencev3.10

    Same Community

    Supported Graph Characteristics Unweighted edges Directed edges Undirected edges Homogeneous vertex types Heterogeneous vertex types Algorithm link: Same Community

    Discover
    Concept
    Concept

    Polblogs readme — Ecosystem

    Political blogosphere Feb. 2005 Data compiled by Lada Adamic and Natalie Glance Node "value" attributes indicate political leaning according to: 0 (left or liberal) 1 (right or conservative) Data on political leaning comes from blog

    Discover
    Reference
    IntermediateReferencev3.10

    Harmonic Centrality

    Supported graph types Edge direction Edge weight Vertex types Undirected, Directed Unweighted Homogeneous, Heterogeneous Maturity level : Pro

    Discover
    Reference
    IntermediateReferencev3.10

    Maximal Independent Set

    Supported Graph Characteristics Undirected edges Homogeneous vertex types Algorithm links: Maximal Independent Set (contains links to all algorithm variants) An independen

    Discover
    Concept
    IntermediateConceptv3.10

    TigerGraph Graph Data Science Library

    TigerGraph In-Database Graph Data Science (GDS) Library is a collection of more than 50 ready-to-use GSQL queries, each of which implements a standard graph or machine learning algorithm. #

    Discover
    Reference
    BeginnerReferencev3.10

    Speaker-Listener Label Propagation

    Supported Graph Characteristics Unweighted edges Directed edges Undirected edges Homogeneous vertex types Heterogeneous vertex types Algorithm lin

    Discover
    123