A Markov random walk under constraint for discovering overlapping communities in complex networks

Detection of overlapping communities in complex networks has motivated recent research in the relevant fields. Aiming this problem, we propose a Markov dynamics based algorithm, called UEOC, which means, 'unfold and extract overlapping communities'. In UEOC, when identifying each natural c...

ver descrição completa

Detalhes bibliográficos
Autor principal: Baquero, Carlos (author)
Outros Autores: Dayou Liu (author), Bo Yang (author), Di Jin (author), Jie Liu (author), Dongxiao He (author)
Formato: article
Idioma:eng
Publicado em: 2011
Assuntos:
Analysis of algorithms
Clustering techniques
Network dynamics
random graphs
networks
Science & Technology
Texto completo:http://hdl.handle.net/1822/33790
País:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/33790

Texto Completo

http://hdl.handle.net/1822/33790

Registros relacionados