[jira] [Created] (SPARK-10994) Local clustering coefficient computation in GraphX

["Yang Yang (JIRA)" <ji...@apache.org>]

Yang Yang created SPARK-10994:
---------------------------------

             Summary: Local clustering coefficient computation in GraphX
                 Key: SPARK-10994
                 URL: https://issues.apache.org/jira/browse/SPARK-10994
             Project: Spark
          Issue Type: New Feature
          Components: GraphX
            Reporter: Yang Yang


We propose to implement an algorithm to compute the local clustering coefficient in GraphX. The local clustering coefficient of a vertex (node) in a graph quantifies how close its neighbors are to being a clique (complete graph). More specifically, the local clustering coefficient C_i for a vertex v_i is given by the proportion of links between the vertices within its neighbourhood divided by the number of links that could possibly exist between them. Duncan J. Watts and Steven Strogatz introduced the measure in 1998 to determine whether a graph is a small-world network. 





--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@spark.apache.org
For additional commands, e-mail: issues-help@spark.apache.org