LEGER, Jean-Benoist; VACHER, Corinne; DAUDIN, Jean-Jacques

doi:10.1007/s11222-013-9395-3

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

LEGER, Jean-Benoist
Mathématiques et Informatique Appliquées [MIA-Paris]

VACHER, Corinne
Biodiversité, Gènes & Communautés [BioGeCo]

DAUDIN, Jean-Jacques
Mathématiques et Informatique Appliquées [MIA-Paris]

Idioma

Article de revue

Este ítem está publicado en

Statistics and Computing. 2014, vol. online first, n° 5, p. 18 p.

Springer Verlag (Germany)

Resumen en inglés

The analysis of complex networks is a rapidly growing topic with many applications in different domains. The analysis of large graphs is often made via unsupervised classification of vertices of the graph. Community detection is the main way to divide a large graph into smaller ones that can be studied separately. However another definition of a cluster is possible, which is based on the structural distance between vertices. This definition includes the case of community clusters but is more general in the sense that two vertices may be in the same group even if they are not connected. Methods for detecting communities in undirected graphs have been recently reviewed by Fortunato. In this paper we expand Fortunato's work and make a review of methods and algorithms for detecting essentially structurally homogeneous subsets of vertices in binary or weighted and directed and undirected graphs.< Leer menos

Palabras clave en inglés

graphs

clusters

random walk

spectral

clustering

stochastic

block

model

bipartite graphs

Metadatos

Licencia de uso del documento

Detection of structurally homogeneous subsets in graphs

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave en inglés

DOI

Orígen

Centros de investigación