Identifying communities by influence dynamics in social networks

@article{Stanoev2011IdentifyingCB,
  title={Identifying communities by influence dynamics in social networks},
  author={Angel Stanoev and Daniel Smilkov and Ljupco Kocarev},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2011},
  volume={84 4 Pt 2},
  pages={
          046102
        }
}
Communities are not static; they evolve, split and merge, appear and disappear, i.e., they are the product of dynamical processes that govern the evolution of a network. A good algorithm for community detection should not only quantify the topology of the network but incorporate the dynamical processes that take place on the network. We present an algorithm for community detection that combines network structure with processes that support the creation and/or evolution of communities. The… 

Figures from this paper

Dynamics of Overlapping Community Structures with Application to Expert Identification

A two-phase algorithm based on two significant rather simple social dynamics named Disassortative degree Mixing and Information Diffusion is proposed—this algorithm is called DMID and results indicate that DMID competitively wins in several cases over the baselines in the community prediction problem.

Investigating Cooperativity of Overlapping Community Structures in Social Networks

This paper calculates the amount of cooperativity in the corresponding networks and communities of these domains of open source software projects and learning forums by applying several community detection algorithms and investigates the community properties, which can be used to infer cooperativity of community structures from their respective properties.

The Significant Effect of Overlapping Community Structures in Signed Social Networks

A two-phase approach to discover overlapping communities in signed networks by identifying most influential nodes (leaders) in the network using network coordination game, and results indicate that overlapping nodes competitively predict signs in comparison to intra and extra nodes.

Network Communities of Dynamical Influence

In applying this technique, the effectiveness of starling flocks was found to be due, in part, to the low outdegree of every bird, where increasing the number of outgoing connections can produce a less responsive flock.

Local dominance unveils clusters in networks

This work considers another perspective built on the notion of local dominance, where low-degree nodes are assigned to the basin of influence of high- degree nodes, and design an efficient algorithm based on local information.

Detecting hierarchical structure of community members in social networks

Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality

This work combines eigenvector centrality with clustering to design a mathematical programming formulation capable of detecting key members while preventing their spheres of influence from overlapping.

Using Content to Identify Overlapping Communities in Question Answer Forums

This paper proposes an algorithm that uses actual content produced by users and combines them by an extended clustering technique, which reveals community properties as well as its relation to contextual information.

Disassortative Degree Mixing and Information Diffusion for Overlapping Community Detection in Social Networks (DMID)

A new two-phase algorithm for overlapping community detection (OCD) in social networks, implemented as a Web service on a federated peer-to-peer infrastructure and demonstrated the correct identification of leaders, high precision and good time complexity.

A simple phenomenological model for time evolution of social networks

A phenomenological model with the simplification of real social networks is proposed to explore the evolutionary features of these networks composed of the entities whose behaviors are dominated by two events: union and division.

References

SHOWING 1-10 OF 39 REFERENCES

Quantifying social group evolution

The focus is on networks capturing the collaboration between scientists and the calls between mobile phone users, and it is found that large groups persist for longer if they are capable of dynamically altering their membership, suggesting that an ability to change the group composition results in better adaptability.

Link communities reveal multiscale complexity in networks

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.

Uncovering the overlapping community structure of complex networks in nature and society

After defining a set of new characteristic quantities for the statistics of communities, this work applies an efficient technique for exploring overlapping communities on a large scale and finds that overlaps are significant, and the distributions introduced reveal universal features of networks.

Community detection in graphs

Finding community structure in very large networks.

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.

Resolution limit in community detection

It is found that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined.

Maps of random walks on complex networks reveal community structure

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 Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics

The novel concept of ModuLand is introduced, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases.

Identifying the role that animals play in their social networks

  • D. LusseauM. Newman
  • Economics
    Proceedings of the Royal Society of London. Series B: Biological Sciences
  • 2004
The network is found to be similar to human social networks in some respects but different in some others, such as the level of assortative mixing by degree within the population, which elucidates some of the means by which the network forms and evolves.

The emergent properties of a dolphin social network

  • D. Lusseau
  • Computer Science
    Proceedings of the Royal Society of London. Series B: Biological Sciences
  • 2003
Despite its small size, the Doubtful Sound community of bottlenose dolphins has the same characteristics of a scale-free power-law network, and the ability for two individuals to be in contact is unaffected by the random removal of individuals.