easygraph.functions.structural_holes.ICC module#

easygraph.functions.structural_holes.ICC.AP_BICC(G, k, K, l)[source]#

an efficient algorithm for structural hole spanners detection.

Returns top k nodes as structural hole spanners, Algorithm 3 of [1]

Parameters:

  • G (easygraph.Graph) – An unweighted and undirected graph.

  • k (int) – top - k structural hole spanners

  • K (int) – the number of candidates K for the top-k hole spanners

  • l (int) – level-l neighbors of nodes

Returns:

V – The list of top-k structural hole spanners.

Return type:

list

Examples

Returns the top k nodes as structural hole spanners, using AP_BICC.

>>> AP_BICC(G,k=3,K=5,l=4)

References

easygraph.functions.structural_holes.ICC.BICC(G, k, K, l)[source]#

an efficient algorithm for structural hole spanners detection.

Returns top k nodes as structural hole spanners, Algorithm 2 of [1]

Parameters:

  • G (easygraph.Graph) – An unweighted and undirected graph.

  • k (int) – top - k structural hole spanners

  • K (int) – the number of candidates K for the top-k hole spanners

  • l (int) – level-l neighbors of nodes

Returns:

V – The list of top-k structural hole spanners.

Return type:

list

Examples

Returns the top k nodes as structural hole spanners, using BICC.

>>> BICC(G,k=3,K=5,l=4)

References

easygraph.functions.structural_holes.ICC.ICC(G, k)[source]#

an efficient algorithm for structural hole spanners detection.

Returns top k nodes as structural hole spanners, Algorithm 1 of [1]

Parameters:

  • G (easygraph.Graph) – An unweighted and undirected graph.

  • k (int) – top - k structural hole spanners

Returns:

V – The list of top-k structural hole spanners.

Return type:

list

Examples

Returns the top k nodes as structural hole spanners, using ICC.

>>> ICC(G,k=3)

References