Louvain
SQL function: cugraph_louvain
Official cuGraph reference: C API
Build a hierarchy of communities by greedily moving vertices and aggregating partitions to maximize modularity.
Quickstart
The call below supplies edges from registered relation target_edges with canonical src and dst columns and may include weight. Substitute your own registered relations.
SELECT * FROM cugraph_louvain(edges => (SELECT src, dst FROM target_edges));
Inputs
Every relation is a named parenthesized SELECT subquery. The required edges role uses canonical src and dst columns; every role, its canonical columns, and their accepted Arrow types are listed under Relation arguments. Metadata validation resolves registered tables named in its JSON request.
Endpoint columns accept numeric Int32, Int64 vertex IDs or logical string Utf8, LargeUtf8, Utf8View vertex IDs; string vertex-identity outputs are canonicalized to Utf8 (native mapping Int64) while scores, distances, counts, coordinates, and opaque labels stay numeric. The shared vertex-ID contract is summarized in Vertex ID support; the concrete call-specific schema comes from gpu_validate_call.
Logical string side-input limitations:
- edge ID columns and edge-ID predicate side inputs are not supported for logical string graphs
Arguments and options
Relation arguments
| Argument | Required | Columns | Description |
|---|---|---|---|
edges | yes |
| edge relation with canonical src and dst columns, plus optional weight and edge_id columns |
Every edge_id column must have the integer type of src and dst; string-keyed graphs accept no edge IDs.
Named value arguments
| Option | Type | Default | Constraints | Description |
|---|---|---|---|---|
max_level | integer | 100 | min 1; max 4294967295 | maximum hierarchy level, at least 1 |
resolution | number | 1 | > 0 | positive community resolution |
threshold | number | 1e-7 | min 0 | non-negative convergence threshold |
Graph construction options
This function requires directed=false (undirected/symmetric graph); all other graph construction options follow the shared defaults documented in Graph Construction Options.
Output
| Column | Type | Nullable | Description |
|---|---|---|---|
vertex | Int64|Utf8 | no | Vertex assigned to a Louvain community. |
partition | Int64 | no | Community identifier assigned by Louvain. |
These are generic descriptor schemas; run gpu_validate_call to get the concrete, table-specific output schema.
Examples
This example runs on the citation network demo dataset.
Compare citation communities against field labels
Two views select the 2010s AI literature (nodes by field-of-study label,
edges where both endpoints qualify), and Louvain partitions it by citation
structure alone. Cross-tabulating each community against primary_fos (with a
window function to keep the top 3 labels per community) shows how closely the
detected communities align with the assigned labels:
CREATE OR REPLACE VIEW ai_nodes AS
SELECT paper_id FROM papers
WHERE year >= 2010 AND primary_fos IN (
'Deep learning', 'Artificial neural network', 'Convolutional neural network',
'Recurrent neural network', 'Natural language processing',
'Reinforcement learning', 'Image segmentation', 'Feature extraction',
'Object detection', 'Speech recognition');
CREATE OR REPLACE VIEW ai_edges AS
SELECT e.src, e.dst
FROM citation_edges e
JOIN ai_nodes a ON a.paper_id = e.src
JOIN ai_nodes b ON b.paper_id = e.dst;
WITH community_fos AS (
SELECT c."partition" AS community, p.primary_fos, COUNT(*) AS n
FROM cugraph_louvain(edges => (SELECT src, dst FROM ai_edges)) c
JOIN papers p ON p.paper_id = c.vertex
GROUP BY c."partition", p.primary_fos),
ranked AS (
SELECT SUM(n) OVER (PARTITION BY community) AS members,
ROW_NUMBER() OVER (PARTITION BY community ORDER BY n DESC) AS rn,
primary_fos,
n
FROM community_fos)
SELECT members, rn, primary_fos, n
FROM ranked
WHERE members > 2500 AND rn <= 3
ORDER BY members DESC, rn;
| members | rn | primary_fos | n |
|---|---|---|---|
| 7,172 | 1 | Convolutional neural network | 2,698 |
| 7,172 | 2 | Deep learning | 2,527 |
| 7,172 | 3 | Artificial neural network | 869 |
| 4,477 | 1 | Deep learning | 1,332 |
| 4,477 | 2 | Recurrent neural network | 1,280 |
| 4,477 | 3 | Artificial neural network | 624 |
| 4,260 | 1 | Image segmentation | 1,919 |
| 4,260 | 2 | Convolutional neural network | 921 |
| 4,260 | 3 | Deep learning | 799 |
| 3,859 | 1 | Reinforcement learning | 3,129 |
| 3,859 | 2 | Artificial neural network | 279 |
| 3,859 | 3 | Deep learning | 226 |
| 3,518 | 1 | Object detection | 2,193 |
| 3,518 | 2 | Convolutional neural network | 467 |
| 3,518 | 3 | Deep learning | 342 |
Louvain (1,233 communities over 38,054 papers) recovers recognizable subfield
boundaries: convolutional-network, sequence-modeling, image-segmentation, and
object-detection communities, plus a reinforcement-learning community that is
81% one label. Note the quoted
"partition", since the output column name is a SQL keyword. cugraph_leiden
is a drop-in replacement with the same call shape.
Limits
No algorithm-specific limitations.
To dry-run validate relation metadata, column types, and options without execution, see gpu_validate_call.