Line graphs of weighted networks for overlapping communities

@article{Evans2010LineGO,
  title={Line graphs of weighted networks for overlapping communities},
  author={T. Evans and R. Lambiotte},
  journal={The European Physical Journal B},
  year={2010},
  volume={77},
  pages={265-272}
}
Abstract. In this paper, we develop the idea to partition the edges of a weighted graph in order to uncover overlapping communities of its nodes. Our approach is based on the construction of different types of weighted line graphs, i.e. graphs whose nodes are the links of the original graph, that encapsulate differently the relations between the edges. Weighted line graphs are argued to provide an alternative, valuable representation of the system’s topology, and are shown to have important… Expand
Weighted line graphs for overlapping community discovery
TLDR
The results indicate that the proposed approach can improve the quality of discovered overlapping communities and remove self-loops in weighted line graphs while sustaining their properties. Expand
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. Expand
Identifying overlapping communities in social networks using multi-scale local information expansion
TLDR
This work proposes a novel algorithm that does not embrace the universal approach but instead of trying to focus on local social ties and modeling multi-scales of social interactions occurring in those networks, optimizes the topological entropy of a network and uncovers communities through a novel dynamic system converging to a local minimum by simply updating the membership vector. Expand
On the edges' PageRank and line graphs.
Two different approaches on a directed (and possibly weighted) network G are considered in order to define the PageRank of each edge of G with the focus on its applications. It is shown that bothExpand
Ego-zones: non-symmetric dependencies reveal network groups with large and dense overlaps
TLDR
A new perspective on the problem of group detection using only the structural properties of networks is presented, pointing out the existence of large and dense overlaps of detected groups that are called zones. Expand
Algorithms for Graph and Network Analysis: Clustering and Search of Motifs in Graphs
TLDR
This article considers two important problems: Network clustering, aiming at finding compact subgraphs inside the input graph in order to isolate molecular complexes, and searching for motifs, i.e., sub-structures repeated in the input network and presenting high significance in terms of their frequency. Expand
Model-Based Edge Clustering
TLDR
This work proposes a model-based approach to clustering the edges of a network using a latent space model describing the features of both actors and latent environments, and derives a generalized EM algorithm for estimation and gradient-based Monte Carlo algorithms. Expand
Numerical and streaming analyses of centrality measures on graphs
TLDR
This talk focuses on Katz Centrality, a linear algebra based metric that measures the affinity between vertices in a graph as a weighted sum of the number of walks between them, and presents an new alternative, agglomerative method of calculating personalized Katz scores. Expand
Overlapping community detection in rating-based social networks through analyzing topics, ratings and links
TLDR
A generic framework for overlapping community detection in social networks with special focus on rating-based social networks is proposed, which considers the information shared by the users (ratings) as well as their topics of interest, for the sake of finding meaningful communities. Expand
A density based link clustering algorithm for overlapping community detection in networks
Abstract Overlapping is an interesting and common characteristic of community structure in networks. Link clustering method for overlapping community detection has attracted a lot of attention in theExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Line graphs, link partitions, and overlapping communities.
  • T. Evans, R. Lambiotte
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2009
TLDR
The role of the degree heterogeneity is discussed and a weighted version of the line graph is proposed in order to account for this and it is shown that any algorithm that produces a partition of nodes can be used to produce a partitions of links. Expand
Extending the definition of modularity to directed graphs with overlapping communities
TLDR
This paper starts from the definition of a modularity function, given by Newman to evaluate the goodness of network community decompositions, and extends it to the more general case of directed graphs with overlapping community structures. Expand
Finding community structure in networks using the eigenvectors of matrices.
  • M. Newman
  • Mathematics, Medicine
  • 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. Expand
Efficient Identification of Overlapping Communities
TLDR
This paper presents an efficient algorithm for finding overlapping communities in social networks that is significantly more efficient than the previous algorithm by Baumes et al and also produces clusters of a comparable or better quality. Expand
Quantifying and identifying the overlapping community structure in networks
It has been shown that the communities of complex networks often overlap with each other. However, there is no effective method to quantify the overlapping community structure. In this paper, weExpand
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems. Expand
Community detection in graphs
TLDR
A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists. Expand
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. Expand
Detecting the overlapping and hierarchical community structure in complex networks
Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that areExpand
Stability of graph communities across time scales
TLDR
The stability of a partition is introduced, a measure of its quality as a community structure based on the clustered autocovariance of a dynamic Markov process taking place on the network, and the dynamical definition provides a unifying framework for several standard partitioning measures. Expand
...
1
2
3
4
5
...