Hi Sirinda, On Thu, Mar 15, 2012 at 8:43 AM, Sirinda Palahan <[email protected]> wrote: > Actually, what I really want is a method to find a partition of edges, not > nodes. > Anyway, the two recommended papers are very useful to me. Thank you very > much. > Any other suggestions would be very welcomed. Thanks again.
See the follow papers for techniques to find overlapping communities by partitioning edges: Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466:761--764, 2010. DOI: 10.1038/nature09182 T. S. Evans and R. Lambiotte. Line graphs, link partitions, and overlapping communities. Phys. Rev. E, 80:016105, 2009. DOI: 10.1103/PhysRevE.80.016105 -- Regards, Minh Van Nguyen http://sage.math.washington.edu/home/mvngu/ _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
