✳flâneur — a map of the web's best reading

Girvan–Newman algorithm

en.wikipedia.org · 601 words · saved by 1 readers

The Girvan–Newman algorithm (named after Michelle Girvan and Mark Newman) is a hierarchical method used to detect communities in complex systems.

Girvan–Newman algorithm - Wikipedia Jump to content From Wikipedia, the free encyclopedia Community detection algorithm The Girvan–Newman algorithm (named after Michelle Girvan and Mark Newman ) is a hierarchical method used to detect communities in complex systems . [ 1 ] Edge betweenness and community structure [ edit ] The Girvan–Newman algorithm detects communities by progressively removing edges from the original network. The connected components of the remaining network are the communities. Instead of trying to construct a measure that tells us which edges are the most central to communi

Explore this link on the map →

related reading