Are we birds of the same feather?

dc.contributor.author	Kompala, N.
dc.contributor.author	Iyengar, S. R. S.
dc.contributor.author	Gupta, Y.
dc.date.accessioned	2021-10-11T07:12:54Z
dc.date.available	2021-10-11T07:12:54Z
dc.date.issued	2021-10-11
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/3011
dc.description.abstract	The paper addresses the community membership problem of predicting whether two nodes belong to the same community or not, using a hill climbing based breadth first traversal algorithm and a probabilistic depth first traversal algorithm. The algorithms have lesser time complexity as compared to the standard community detection algorithms. The proposed algorithms achieve a high efficiency in terms of the fraction of node pairs correctly identified, which is greater than 70% in most of the network instances. Moreover, a very little fraction of the graph is traversed which is local to the nodes in consideration.	en_US
dc.language.iso	en_US	en_US
dc.subject	Community detection	en_US
dc.subject	breadth first traversal	en_US
dc.subject	depth first traversal	en_US
dc.title	Are we birds of the same feather?	en_US
dc.type	Article	en_US