Skip to content
This repository has been archived by the owner on Oct 8, 2021. It is now read-only.

feature: Graph Transitivity #1556

Open
gerdm opened this issue Apr 3, 2021 · 3 comments
Open

feature: Graph Transitivity #1556

gerdm opened this issue Apr 3, 2021 · 3 comments
Labels
waiting on author requires additional information from author

Comments

@gerdm
Copy link

gerdm commented Apr 3, 2021

I propose to implement the "Graph Transitivity" coefficient for undirected graphs as presented in the book Complex Networks: Principles, Methods and Applications by Latora, V, et.al

image

Would this be a welcomed PR?

Latora, V., Nicosia, V., & Russo, G. (2017). Complex Networks: Principles, Methods and Applications. Cambridge: Cambridge University Press. doi:10.1017/9781316216002
@sbromberger
Copy link
Owner

It would be, but you'd need to produce a state of the art triangle counting algorithm as well. Consider the previous work done by @abhinavmehndiratta here.

@sbromberger
Copy link
Owner

@gerdm - just checking in. Are you still working on this?

@sbromberger sbromberger added the waiting on author requires additional information from author label Jun 5, 2021
@gerdm
Copy link
Author

gerdm commented Jun 6, 2021

Hi @sbromberger,

Not at the moment since I'm working on other projects. However, if no-one is working on this issue once I'm available I'd be happy to retake it.

@gdalle gdalle mentioned this issue Nov 11, 2021
Open
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Assignees
No one assigned
Labels
waiting on author requires additional information from author
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@sbromberger @gerdm