Complex networks topologies present interesting and surprising properties,
such as community structures, which can be exploited to optimize communication,
to find new efficient and context-aware routing algorithms or simply to
understand the dynamics and meaning of relationships among nodes. Complex
networks are gaining more and more importance as a reference model and are a
powerful interpretation tool for many different kinds of natural, biological
and social networks, where directed relationships and contextual belonging of
nodes to many different communities is a matter of fact. This paper starts from
the definition of modularity function, given by M. Newman to evaluate the
goodness of network community decompositions, and extends it to the more
general case of directed graphs with overlapping community structures.
Interesting properties of the proposed extension are discussed, a method for
finding overlapping communities is proposed and results of its application to
benchmark case-studies are reported. We also propose a new dataset which could
be used as a reference benchmark for overlapping community structures
identification.
Description
Extending modularity definition for directed graphs with overlapping
communities
%0 Generic
%1 Nicosia2008
%A Nicosia, V.
%A Mangioni, G.
%A Carchiolo, V.
%A Malgeri, M.
%D 2008
%K COMMUNE community directed graph modularity network overlapping
%T Extending the definition of modularity to directed graphs with
overlapping communities
%U http://arxiv.org/abs/0801.1647
%X Complex networks topologies present interesting and surprising properties,
such as community structures, which can be exploited to optimize communication,
to find new efficient and context-aware routing algorithms or simply to
understand the dynamics and meaning of relationships among nodes. Complex
networks are gaining more and more importance as a reference model and are a
powerful interpretation tool for many different kinds of natural, biological
and social networks, where directed relationships and contextual belonging of
nodes to many different communities is a matter of fact. This paper starts from
the definition of modularity function, given by M. Newman to evaluate the
goodness of network community decompositions, and extends it to the more
general case of directed graphs with overlapping community structures.
Interesting properties of the proposed extension are discussed, a method for
finding overlapping communities is proposed and results of its application to
benchmark case-studies are reported. We also propose a new dataset which could
be used as a reference benchmark for overlapping community structures
identification.
@misc{Nicosia2008,
abstract = { Complex networks topologies present interesting and surprising properties,
such as community structures, which can be exploited to optimize communication,
to find new efficient and context-aware routing algorithms or simply to
understand the dynamics and meaning of relationships among nodes. Complex
networks are gaining more and more importance as a reference model and are a
powerful interpretation tool for many different kinds of natural, biological
and social networks, where directed relationships and contextual belonging of
nodes to many different communities is a matter of fact. This paper starts from
the definition of modularity function, given by M. Newman to evaluate the
goodness of network community decompositions, and extends it to the more
general case of directed graphs with overlapping community structures.
Interesting properties of the proposed extension are discussed, a method for
finding overlapping communities is proposed and results of its application to
benchmark case-studies are reported. We also propose a new dataset which could
be used as a reference benchmark for overlapping community structures
identification.
},
added-at = {2010-04-22T16:46:33.000+0200},
author = {Nicosia, V. and Mangioni, G. and Carchiolo, V. and Malgeri, M.},
biburl = {https://www.bibsonomy.org/bibtex/27d8bb9ffc0402259940814addb6954c5/folke},
description = {Extending modularity definition for directed graphs with overlapping
communities},
interhash = {06d111f009747dda641e0b28e7777ce0},
intrahash = {7d8bb9ffc0402259940814addb6954c5},
keywords = {COMMUNE community directed graph modularity network overlapping},
note = {cite arxiv:0801.1647
Comment: 22 pages, 11 figures},
timestamp = {2010-04-22T16:46:34.000+0200},
title = {Extending the definition of modularity to directed graphs with
overlapping communities},
url = {http://arxiv.org/abs/0801.1647},
year = 2008
}