The map equation for link community

@article{Kim2011TheME,
  title={The map equation for link community},
  author={Youngdo Kim and Hawoong Jeong},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2011},
  volume={84 2 Pt 2},
  pages={
          026110
        }
}
  • Youngdo Kim, Hawoong Jeong
  • Published 2 May 2011
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Community structure exists in many real-world networks and has been reported being related to several functional properties of the networks. The conventional approach was partitioning nodes into communities, while some recent studies start partitioning links instead of nodes to find overlapping communities of nodes efficiently. We extended the map equation method, which was originally developed for node communities, to find link communities in networks. This method is tested on various kinds of… 

Figures and Tables from this paper

Markov Dynamics based on Link-node-link Random Walk to Reveal Link Communities in Complex Networks
TLDR
A Markov dynamics based algorithm for the detection of link communities, which takes the form of recursive bipartition is proposed, which has been evaluated both on synthetic benchmarks and on some real-world networks and shown that it is highly effective for discovering link communities in complex networks.
Probabilistic Community Using Link and Content for Social Networks
TLDR
An overlapping community detection method, namely, latent Dirichlet allocation-based link partition (LBLP), which uses a graphical model and considers network structure and content information is proposed, which is effective and beneficial in mining community structure.
Discovering link communities in complex networks by exploiting link dynamics
TLDR
The experimental results show that the proposed link dynamics based algorithm, called UELC, is highly effective for discovering link communities in complex networks and extended to extracting communities of nodes, and it is effective for node community identification.
An Improved Genetic-Based Link Clustering for Overlapping Community Detection
TLDR
An effective method to solve the “excessive overlap” problem is defined and the experimental results shows that the proposed algorithm is effective and efficient on both simulate networks and real networks.
Overlapping Community Detection Based on Information Dynamics
TLDR
A new model called OCDID (Overlapping Community Detection based on Information Dynamics) is proposed to uncover the overlapping communities, which treats the network as a dynamical system that allows an individual to communicate and share information with its neighbors.
Overlapping Community Extraction: A Link Hypergraph Partitioning Based Method
TLDR
This paper defines the local link structure composed of a set of closely interrelated links, by extending the similarity of link-pairs to that of a group of links, and transforms the problem of mining local link structures into a pattern mining problem, and presents an efficient mining algorithm.
Detecting Link Communities Based on Local Approach
TLDR
A novel algorithm LBLC (local based link community) is proposed to detect link communities in the network based on local information to achieve significant improvement on link community structure.
Discovering communities in complex networks by edge label propagation
TLDR
A novel edge label propagation algorithm (ELPA), which combines the natural advantage of link communities with the efficiency of the label propagation algorithms (LPA), and can discover both link communities and node communities.
Link community detection by non-negative matrix factorization with multi-step similarities
TLDR
This paper proposes a non-negative matrix factorization (NMF) based method to detect the link community structures by introducing multi-step similarities using the graph random walk approach so that the similarities between non-neighbor nodes can be captured.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 110 REFERENCES
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Detecting the overlapping and hierarchical community structure in complex networks
TLDR
The first algorithm that finds both overlapping communities and the hierarchical structure is presented, based on the local optimization of a fitness function, enabling different hierarchical levels of organization to be investigated.
Near linear time algorithm to detect community structures in large-scale networks.
TLDR
This paper investigates a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities.
Finding community structure in networks using the eigenvectors of matrices.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.
Finding community structure in very large networks.
TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.
Link communities reveal multiscale complexity in networks
TLDR
It is implied that link communities are fundamental building blocks that reveal overlap and hierarchical organization in networks to be two aspects of the same phenomenon.
Modularity and community structure in networks.
  • M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2006
TLDR
It is shown that the modularity of a network can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which is called modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times.
Fuzzy communities and the concept of bridgeness in complex networks.
TLDR
An algorithm for determining the optimal membership degrees with respect to a given goal function is created, and a measure is introduced that is able to identify outlier vertices that do not belong to any of the communities, bridges that have significant membership in more than one single community, and regular Vertices that fundamentally restrict their interactions within their own community.
Community detection in graphs
Fast unfolding of communities in large networks
TLDR
This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
...
1
2
3
4
5
...