7.00.02 - Unweighted, Directed Network (BDN) - Aster Analytics

Teradata Aster® Analytics Foundation User GuideUpdate 2

Product
Aster Analytics
Release Number
7.00.02
Published
September 2017
Content Type
Programming Reference
User Guide
Publication ID
B700-1022-700K
Language
English (United States)
Last Update
2018-04-17

For an unweighted, directed network (BDN), given a vertex i, the BDN triangle types can be categorized to four patterns.

Triangle Type Patterns
Pattern Description Illustration
Cycle There is a cyclical relation among i and any two of its neighbors: ijhi, or the reverse.


Middleman One of i’s neighbors, j, both holds an outward edge to a third neighbor, h, and uses i to reach h in two steps.


In i holds two inward edges.
Out i holds two outward edges.


For each pattern, the clustering coefficient (CC) is:

c i * = δ i * / τ i *

where {*}={cycle, middleman, in, out}.

Triples for each pattern are:

τ i cyc = d i in d i out - d i

where d i is the number of bilateral edges between i and its neighbors.

τ i mid = d i in d i out - d i

τ i in = d i in (d i in - 1)

τ i out = d i out (d i out - 1)