Adamic Adar
The Adamic/Adar index is a measure according to the number of shared links between two vertices. It is defined as the sum of the inverse logarithmic degree centrality of the neighbors shared by the two vertices.
\[{A(x,y)=\sum _{u\in N(x)\cap N(y)}{\frac {1}{\log {|N(u)|}}}}\]
Where \({N(u)}\) is the set of vertices adjacent to u.
This algorithm was created in 2003 by Lada Adamic and Eytan Adar.
Specifications
CREATE QUERY tg_adamic_adar(VERTEX v_source VERTEX v_target, SET<STRING> e_type)
Parameters
Name | Description | Default value |
---|---|---|
|
The first vertex to compare. Provide the vertex ID and type as a tuple: |
N/A |
|
The second vertex to compare with the first. Provide the vertex ID and type as a tuple: |
N/A |
|
Edge types to traverse. |
(A blank set of strings) |