Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > A Markov random walk under constraint for discovering overlapping communities in complex networks
Publication

Publications

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

Title
A Markov random walk under constraint for discovering overlapping communities in complex networks
Type
Article in International Scientific Journal
Year
2011
Authors
Jin, D
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Yang, B
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Baquero, C
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Liu, DY
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
He, DX
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Liu, J
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Other information
Authenticus ID: P-002-S4J
Abstract (EN): The detection of overlapping communities in complex networks has motivated recent research in relevant fields. Aiming to address this problem, we propose a Markov-dynamics-based algorithm, called UEOC, which means 'unfold and extract overlapping communities'. In UEOC, when identifying each natural community that overlaps, a Markov random walk method combined with a constraint strategy, which is based on the corresponding annealed network (degree conserving random network), is performed to unfold the community. Then, a cutoff criterion with the aid of a local community function, called conductance, which can be thought of as the ratio between the number of edges inside the community and those leaving it, is presented to extract this emerged community from the entire network. The UEOC algorithm depends on only one parameter whose value can be easily set, and it requires no prior knowledge of the hidden community structures. The proposed UEOC has been evaluated both on synthetic benchmarks and on some real-world networks, and has been compared with a set of competing algorithms. The experimental result has shown that UEOC is highly effective and efficient for discovering overlapping communities.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 22
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Extending a configuration model to find communities in complex networks (2013)
Article in International Scientific Journal
Jin, D; He, DX; Hu, QH; Baquero, C; Yang, B
Combined role of molecular diffusion, mean streaming and helicity in the eddy diffusivity of short-correlated random flows (2016)
Article in International Scientific Journal
Marco Martins Afonso; Andrea Mazzino; Sílvio Gama
Anomalous diffusion of inertial particles in random parallel flows: theory and numerics face to face (2015)
Article in International Scientific Journal
Boi, S; Afonso, MM; Mazzino, A
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-24 at 23:05:21 | Privacy Policy | Personal Data Protection Policy | Whistleblowing