Community structure in social and biological networks

@article{Girvan2002CommunitySI,
  title={Community structure in social and biological networks},
  author={Michelle Girvan and Mark E. J. Newman},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  year={2002},
  volume={99},
  pages={7821 - 7826}
}
  • M. Girvan, M. Newman
  • Published 7 December 2001
  • Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
A number of recent studies have focused on the statistical properties of networked systems such as social networks and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this article, we highlight another property that is found in many networks, the property of community structure, in which network nodes are joined together in tightly… 

Figures from this paper

Detecting Communities in Social Networks Using Local Information
TLDR
This paper proposes a new measure of local community structure, coupled with a two-phase algorithm that extracts all possible candidates first, and then optimizes the community hierarchy, and proposes a community discovery process for large networks that iteratively finds communities based on this measure.
Statistical properties of community structure in large social and information networks
TLDR
It is found that a generative model, in which new edges are added via an iterative "forest fire" burning process, is able to produce graphs exhibiting a network community structure similar to that observed in nearly every network dataset examined.
Community Detection Based on Weighted Networks
TLDR
This paper proposes another community detecting algorithm taking into account weights of links, which turns to be especially suitable to the analysis of social and information networks.
Structural and regular equivalence of community detection in social networks
  • Sovatana Hour, Li Kan
  • Computer Science
    2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)
  • 2014
TLDR
The blockmodeling, a collection of methods for partitioning networks according to well-specified criteria, and gives the idea about how community is detected in social networking by Euclidean distance algorithm and REGE algorithm.
Algorithms for discovering communities in complex networks
TLDR
This work proposes an algorithm that utilizes centrality metrics of the nodes to compute the importance of the edges in the network, and proposes a hash-table-based technique that helps to compute bibliometric similarity between nodes in O( m Δ) time.
Characterizing the Community Structure of Complex Networks
TLDR
A systematic empirical analysis of the statistical properties of communities in large information, communication, technological, biological, and social networks finds that the mesoscopic organization of networks of the same category is remarkably similar.
Finding Community Structure with Performance Guarantees in Scale-Free Networks
  • Thang N. Dinh, M. Thai
  • Computer Science
    2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing
  • 2011
TLDR
It is shown, using analytical arguments, that the power-law topology indicates the presence of community structure, and an approximation algorithm for finding community structure via maximizing the modularity that guarantees optimal solutions up to a constant factor is provided.
...
...

References

SHOWING 1-10 OF 55 REFERENCES
Random graphs with arbitrary degree distributions and their applications.
TLDR
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
The cohesiveness of blocks in social networks: Node connectivity and conditional density
This study shows several ways that formal graph theoretic statements map patterns of network ties into substantive hypotheses about social cohesion. If network cohesion is enhanced by multiple
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Social Network Analysis
This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is argued
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
TLDR
It is argued that simple networks such as these cannot capture variation in the strength of collaborative ties and proposed a measure of collaboration strength based on the number of papers coauthored by pairs of scientists, and thenumber of other scientists with whom they coauthored those papers.
Classes of small-world networks.
TLDR
Evidence of the occurrence of three classes of small-world networks, characterized by a vertex connectivity distribution that decays as a power law law, and the nature of such constraints may be the controlling factor for the emergence of different classes of networks are presented.
Scientific collaboration networks. I. Network construction and fundamental results.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
TLDR
Using computer databases of scientific papers in physics, biomedical research, and computer science, a network of collaboration between scientists in each of these disciplines is constructed, and a number of measures of centrality and connectedness in the same networks are studied.
The structure of scientific collaboration networks.
  • M. Newman
  • Physics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2001
TLDR
It is shown that these collaboration networks form "small worlds," in which randomly chosen pairs of scientists are typically separated by only a short path of intermediate acquaintances.
Emergence of scaling in random networks
TLDR
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Connectivity of growing random networks.
TLDR
A solution for the time- and age-dependent connectivity distribution of a growing random network is presented and the power law N(k) approximately k(-nu) is found, where the exponent nu can be tuned to any value in the range 2.
...
...