[FLINK-4934] Triadic Census

• Type: New Feature
• Status: Closed
• Priority: Major
• Resolution: Implemented
• Affects Version/s: 1.2.0
• Fix Version/s: 1.2.0
• Component/s: Library / Graph Processing
• Assignee: Greg Hogan
• Reporter: Greg Hogan
• Created: 26/Oct/16 14:03
• Updated: 10/Nov/16 17:16
• Resolved: 10/Nov/16 17:16

Description

A triad is any three vertices in a graph. An undirected graph has 4 types of triads (with 0, 1, 2, or 3 edges among the three vertices) and a directed graph has 16 types (http://vlado.fmf.uni-lj.si/pub/networks/doc/triads/triads.pdf).

This can be implemented as an analytic. The undirected implementation will use VertexMetrics and TriangleCount. The directed implementation will use VertexDegrees and TriangleListing with postprocessing.

This could be added to the TriangleListing driver in Gelly examples.

Issue Links

• links to: GitHub Pull Request #2731