clustering coefficient (counting triangles) in gps.

[suijia...@gmail.com]

Hi, Experts,
  Does anybody know if there are example implementations of clustering coefficient (counting triangles) in gps? Thanks!

  Best Regards,
  Suijian

[Semih Salihoglu]

Hi Sujian,

There's one compiled from green-marl but we haven't check those in. However it's quite simple. Each vertex first finds all possible open triads by receiving the adjacency list of its neighbors. Then finds the closing triangles locally. This is quite unoptimized. You can do some tricks on top of it and not send all your adjacency list to your neighbor u but only those neighbors with id greater than u.

Best,

semih

> --
> You received this message because you are subscribed to the Google Groups "stanfordgpsusers" group.
> To unsubscribe from this group and stop receiving emails from it, send an email to stanfordgpsuse...@googlegroups.com.
> For more options, visit https://groups.google.com/d/optout.
>

[suijia...@gmail.com]

Hi, Semih,
  Thanks for this info, that seems in C++, it will be good if there's an example implementation in Java in GPS as clustering coefficient is so popular.

  Best Regards,
  Suijian


在 2014年3月18日星期二UTC-5上午1时08分12秒，Semih Salihoglu写道：