Power Graph Greedy Algorithm
The power graph greedy algorithm relies on two simple steps to perform the decomposition:
The first step identifies candidate power nodes through a hierarchical clustering of the nodes in the network based on the similarity of their neighboring nodes. The similarity of two sets of neighbors is taken as the Jaccard index of the two sets.
The second step performs a greedy search for possible power edges between candidate power nodes. Power edges abstracting the most edges in the original network are added first to the power graph. Thus bicliques, cliques and stars are incrementally replaced with power edges, until all remaining single edges are also added. Candidate power nodes that are not the end point of any power edge are ignored.
Read more about this topic: Power Graph Analysis
Famous quotes containing the words power, graph and/or greedy:
“Love prays. It makes covenants with Eternal Power in behalf of this dear mate.”
—Ralph Waldo Emerson (1803–1882)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)
“There is a very fine line between loving life and being greedy for it.”
—Maya Angelou (b. 1928)