neo4j-contrib / neo4j-graph-algorithms

Efficient Graph Algorithms for Neo4j
https://github.com/neo4j/graph-data-science/
GNU General Public License v3.0
770 stars 194 forks source link

add a version of triangle counting that counts stable and unstable triangles based on weight #329

Open jexp opened 7 years ago

jexp commented 7 years ago

add optional weights positive relationship, weight > 0 negative relationship, weight <= 0

allow to configure which triangles are meant to be stable, default is [1,1,1] and [1,1,-1] output stable/instable triangle count per node for outputting the triangles also output (boolean) if it is stable or unstable under the configuration

Then we can infer if the graph in global or local scale has stable or instable properties

see: Networks Crowds and Markets or https://www.youtube.com/watch?v=qEKNFOaGQcc

jexp commented 7 years ago

Have a version of this that predicts the missing link between three nodes based on config for "stable triangles"

tomasonjo commented 7 years ago

This could also output global stat "Fraction of closed triangles". They use this stat on SNAP datasets to describe graphs.