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...

Full description

Bibliographic Details
Main Author: Baquero, Carlos (author)
Other Authors: Dayou Liu (author), Bo Yang (author), Di Jin (author), Jie Liu (author), Dongxiao He (author)
Format: article
Language:eng
Published: 2011
Subjects:
Analysis of algorithms
Clustering techniques
Network dynamics
random graphs
networks
Science & Technology
Online Access:http://hdl.handle.net/1822/33790
Country:Portugal
Oai:oai:repositorium.sdum.uminho.pt:1822/33790

Internet

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

Similar Items