Hierarchical community structure in complex (social) networks

@article{Massaro2014HierarchicalCS,
  title={Hierarchical community structure in complex (social) networks},
  author={Emanuele Massaro and Franco Bagnoli},
  journal={ArXiv},
  year={2014},
  volume={abs/1402.7340}
}
The investigation of community structure in networks is a task of great importance in many disciplines, namely physics, sociology, biology and computer science where systems are often represented as graphs. One of the challenges is to find local communities from a local viewpoint in a graph without global information in order to reproduce the subjective hierarchical vision for each vertex. In this paper we present the improvement of an information dynamics algorithm in which the label… 

Figures from this paper

A cognitive-inspired algorithm for growing networks
TLDR
The model emulates people’s strategies for acquiring information in social networks, emphasising the local subjective view of an individual and what kind of information the individual can acquire when arriving in a new social context.
Characterizing the Evolution of Communities on Reddit
TLDR
Experimental results showed that the linguistic style of users who make posts and the interaction dynamics of members in a community are related to different parts of communities’ evolution with respect to the number of active users.

References

SHOWING 1-10 OF 29 REFERENCES
Finding local community structure in networks.
  • A. Clauset
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
TLDR
This work defines both a measure of local community structure and an algorithm that infers the hierarchy of communities that enclose a given vertex by exploring the graph one vertex at a time, and uses this algorithm to extract meaningful local clustering information in the large recommender network of an online retailer.
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.
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.
Defining and identifying communities in networks.
TLDR
This article proposes a local algorithm to detect communities which outperforms the existing algorithms with respect to computational cost, keeping the same level of reliability and applies to a network of scientific collaborations, which, for its size, cannot be attacked with the usual methods.
Maps of random walks on complex networks reveal community structure
TLDR
An information theoretic approach is introduced that reveals community structure in weighted and directed networks of large-scale biological and social systems and reveals a directional pattern of citation from the applied fields to the basic sciences.
Community detection in graphs
Exploring Local Community Structures in Large Networks
  • Feng Luo, J. Wang, Eric Promislow
  • Computer Science
    2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06)
  • 2006
TLDR
This paper extends the concept of degree from single vertex to sub-graph, and presents a formal definition of module/community in a network based on this extension, and implements a JAVA tool, MoNet, for exploring local community structures in large networks.
Detecting community structure in networks
TLDR
A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.
An information-theoretic framework for resolving community structure in complex networks
TLDR
An information-theoretic foundation for the concept of modularity in networks is developed and the modules of which the network is composed are identified by finding an optimal compression of its topology, capitalizing on regularities in its structure.
Towards Online Multiresolution Community Detection in Large-Scale Networks
TLDR
A new quality function of local community is introduced and a fast local expansion algorithm for uncovering communities in large-scale networks is presented, which can detect multiresolution community from a source vertex or communities covering the whole network.
...
...