The small community phenomenon in networks: models, algorithms and applications

Authors:
Pan Peng
Affiliations:
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China,School of Information Science and Engineering, Graduate University of China Academy of Sciences, ...
Venue:
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Year:
2012

Citing 16
Cited 0

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On clusterings: Good, bad and spectral

Journal of the ACM (JACM)
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Communities from seed sets

Proceedings of the 15th international conference on World Wide Web
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)

The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
On certain connectivity properties of the internet topology

Journal of Computer and System Sciences - Special issue on FOCS 2003
Local Graph Partitioning using PageRank Vectors

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Finding sparse cuts locally using evolving sets

Proceedings of the forty-first annual ACM symposium on Theory of computing
IsoRankN

Bioinformatics
Empirical comparison of algorithms for network community detection

Proceedings of the 19th international conference on World wide web
Networks, Crowds, and Markets: Reasoning About a Highly Connected World

Networks, Crowds, and Markets: Reasoning About a Highly Connected World
Social networks spread rumors in sublogarithmic time

Proceedings of the forty-third annual ACM symposium on Theory of computing
Algorithms to detect multiprotein modularity conserved during evolution

ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Survey: Graph clustering

Computer Science Review
The small-community phenomenon in networks

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey a recent new line of research on the small community phenomenon in networks, which characterizes the intuition and observation that in a broad class of networks, a significant fraction of nodes belong to some small communities. We propose the formal definition of this phenomenon as well as the definition of communities, based on which we are able to both study the community structure of network models, i.e., whether a model exhibits the small community phenomenon or not, and design new models that embrace this phenomenon in a natural way while preserving some other typical network properties such as the small diameter and the power law degree distribution. We also introduce the corresponding community detection algorithms, which not only are used to identify true communities and confirm the existence of the small community phenomenon in real networks but also have found other applications, e.g., the classification of networks and core extraction of networks.