A fast and efficient algorithm to identify clusters in networks
A characteristic feature of many relevant real life networks, like the WWW, Internet, transportation and communication networks, or even biological and social networks, is their clustering structure. We discuss in this paper a novel algorithm to identify clusters -sets of densely interconnected node...
| Autores: | ; |
|---|---|
| Tipo de documento: | Artículo |
| Fecha de publicación: | 2008 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Lenguaje: | Inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/2591 |
| Acceso en línea: | https://hdl.handle.net/2117/2591 |
| Nivel de acceso: | Acceso abierto |
| Palabra clave: | Combinatorics graphs clusters networks complex systems Combinacions (Matemàtica) Classificació AMS::05 Combinatorics Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | A characteristic feature of many relevant real life networks, like the WWW, Internet, transportation and communication networks, or even biological and social networks, is their clustering structure. We discuss in this paper a novel algorithm to identify clusters -sets of densely interconnected nodes- in a network. The algorithm is based on local information and therefore it is very fast with respect other proposed methods, while it keeps a similar performance in detecting the clusters. |
|---|